2 курс. Программирование на C++. Турнир 1, осень 2021

вход курсы / турниры задачи участники консоль модули компиляторы ключевые слова результаты

ru en cn

5481978

Пользователь

Псарев Александр Павлович

Время

22:28<< 13.10.2021 22:29 (9 д. 02:46) 22:30>>

Обработка

22:29 ... 22:29 (5,72 сек.)

Файл

5481978.cpp (CLang++ 5.0.0 + Address Sanitizer)

Турнир

2 курс. Программирование на C++. Турнир 1, осень 2021

Задача

C: Set

Набор тестов

Ограничения

Время: 1с Память: 512Мб

Состояние [?]

LI	Ошибка проверки исходного кода

код | результаты

set.h:11:  Redundant blank line at the start of a code block should be deleted.  [whitespace/blank_line] [2]
set.h:11:  Redundant blank line at the end of a code block should be deleted.  [whitespace/blank_line] [3]
set.h:48:  Lines should be <= 80 characters long  [whitespace/line_length] [2]
set.h:49:  { should almost always be at the end of the previous line  [whitespace/braces] [4]
set.h:58:  Lines should be <= 80 characters long  [whitespace/line_length] [2]
set.h:59:  { should almost always be at the end of the previous line  [whitespace/braces] [4]
set.h:61:  An else should appear on the same line as the preceding }  [whitespace/newline] [4]
set.h:61:  If an else has a brace on one side, it should have it on both  [readability/braces] [5]
set.h:70:  Lines should be <= 80 characters long  [whitespace/line_length] [2]
set.h:71:  { should almost always be at the end of the previous line  [whitespace/braces] [4]
set.h:73:  An else should appear on the same line as the preceding }  [whitespace/newline] [4]
set.h:73:  If an else has a brace on one side, it should have it on both  [readability/braces] [5]
set.h:78:  Lines should be <= 80 characters long  [whitespace/line_length] [2]
set.h:79:  { should almost always be at the end of the previous line  [whitespace/braces] [4]
set.h:81:  An else should appear on the same line as the preceding }  [whitespace/newline] [4]
set.h:81:  If an else has a brace on one side, it should have it on both  [readability/braces] [5]
set.h:89:  { should almost always be at the end of the previous line  [whitespace/braces] [4]
set.h:91:  An else should appear on the same line as the preceding }  [whitespace/newline] [4]
set.h:91:  If an else has a brace on one side, it should have it on both  [readability/braces] [5]
set.h:119:  Could not find a newline character at the end of the file.  [whitespace/ending_newline] [5]
Done processing set.h
Total errors found: 20

[печатать | | ]

≡

#include <vector>
#include <algorithm>

class Set {
 private:
const int FlAG_SIZE = 10000000;

public:
std::vector<int64_t> set;
Set() {

}
Set& operator=(const Set& other) {
this->set = other.set;
return *this;
}
Set(const std::vector<int64_t>& v) {
std::vector<bool> flags(FlAG_SIZE, false);
for (int i = 0; i < v.size(); ++i) {
if (flags[v[i]] == false) {
flags[v[i]] = true;
this->set.push_back(v[i]);
}
}
std::sort(this->set.begin(), this->set.end());
}
Set Union(const Set& firstSet) {
std::vector<bool> flags(FlAG_SIZE, false);
std::vector<int64_t> newSet;
for (int i = 0; i < firstSet.set.size(); ++i) {
if (!flags[firstSet.set[i]]) {
newSet.push_back(firstSet.set[i]);
flags[firstSet.set[i]] = true;
}
}
for (int i = 0; i < this->set.size(); ++i) {
if (!flags[this->set[i]]) {
newSet.push_back(this->set[i]);
flags[this->set[i]] = true;
}
}
std::sort(newSet.begin(), newSet.end());
return { newSet };
}
Set Intersection(const Set& firstSet) {
std::vector<int64_t> res;
for (int i = 0; i < firstSet.set.size(); ++i) {
if (std::find(this->set.begin(), this->set.end(), firstSet.set[i]) != this->set.end())
{
res.push_back(firstSet.set[i]);
}
}
return { res };
}
Set Difference(const Set& firstSet) {
std::vector<int64_t> res;
for (int i = 0; i < firstSet.set.size(); ++i) {
if (std::find(this->set.begin(), this->set.end(), firstSet.set[i]) != this->set.end())
{
}
else {
res.push_back(firstSet.set[i]);
}
}
return { res };
}
Set SymmetricDifference(const Set& firstSet) {
std::vector<int64_t> res;
for (int i = 0; i < firstSet.set.size(); ++i) {
if (std::find(this->set.begin(), this->set.end(), firstSet.set[i]) != this->set.end())
{
}
else {
res.push_back(firstSet.set[i]);
}
}
for (int i = 0; i < this->set.size(); ++i) {
if (std::find(firstSet.set.begin(), firstSet.set.end(), this->set[i]) != firstSet.set.end())
{
}
else {
res.push_back(this->set[i]);
}
}
return { res };
}
void Add(int64_t element) {
if (std::find(this->set.begin(), this->set.end(), element) != this->set.end())
{
}
else {
this->set.push_back(element);
}
}
bool Contains(int64_t element) {
for (int i = 0; i < this->set.size(); ++i) {
if (this->set[i] == element) {
return true;
}
}
return false;
}
void Remove(int64_t element) {
for (int i = 0; i < this->set.size(); ++i) {
if (this->set[i] == element) {
this->set.erase(this->set.begin() + i);
}
}
}
vector<int64_t> Data() {
return this->set;
}
void Print() {
for (auto var : set) {
cout << var << " ";
}
cout << endl;
}
};

(2 459 b)

0.066s 0.008s 10