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

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

ru en cn

5481814

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

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

Время

22:06<< 13.10.2021 22:07 (9 д. 02:23) 22:07>>

Обработка

22:07 ... 22:07 (8,15 сек.)

Файл

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

Турнир

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

Задача

C: Set

Набор тестов

Ограничения

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

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

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

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

set.h:47:  Lines should be <= 80 characters long  [whitespace/line_length] [2]
set.h:48:  { should almost always be at the end of the previous line  [whitespace/braces] [4]
set.h:57:  Lines should be <= 80 characters long  [whitespace/line_length] [2]
set.h:66:  Lines should be <= 80 characters long  [whitespace/line_length] [2]
set.h:71:  Lines should be <= 80 characters long  [whitespace/line_length] [2]
Done processing set.h
Total errors found: 5

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

≡

#include <vector>
#include <algorithm>

class Set {
 private:
const int FLAGS = 10e9;

public:
std::vector <int64_t> set;
Set() {
}
Set& operator=(const Set& other) {
this->set = other.set;
return *this;
}
explicit Set(const std::vector<int64_t>& vec) {
std::vector <bool> flags(FLAGS, false);
for (int i = 0; i < vec.size(); i++) {
if (!flags[vec[i]]) {
flags[vec[i]] = true;
this->set.push_back(vec[i]);
}
}
sort(this->set.begin(), this->set.end());
}
Set Union(const Set& join_set) {
std::vector <bool> flags(FLAGS, false);
std::vector <int64_t> new_set;
for (int i = 0; i < join_set.set.size(); i++) {
if (!flags[join_set.set[i]]) {
new_set.push_back(join_set.set[i]);
flags[join_set.set[i]] = true;
}
}
for (int i = 0; i < this->set.size(); i++) {
if (!flags[this->set[i]]) {
new_set.push_back(this->set[i]);
flags[this->set[i]] = true;
}
}
sort(new_set.begin(), new_set.end());
return { new_set };
}
Set Intersection(const Set& join_set) {
std::vector <int64_t> result;
for (int i = 0; i < join_set.set.size(); i++) {
if (std::find(this->set.begin(), this->set.end(), join_set.set[i]) != this->set.end())
{
result.push_back(join_set.set[i]);
}
}
return { result };
}
Set Difference(const Set& join_set) {
std::vector <int64_t> result;
for (int i = 0; i < join_set.set.size(); i++) {
if (std::find(this->set.begin(), this->set.end(), join_set.set[i]) == this->set.end()) {
result.push_back(join_set.set[i]);
}
}
return { result };
}
Set SymmetricDifference(const Set& join_set) {
std::vector <int64_t> result;
for (int i = 0; i < join_set.set.size(); i++) {
if (std::find(this->set.begin(), this->set.end(), join_set.set[i]) == this->set.end()) {
result.push_back(join_set.set[i]);
}
}
for (int i = 0; i < this->set.size(); i++) {
if (std::find(join_set.set.begin(), join_set.set.end(), this->set[i]) == join_set.set.end()) {
result.push_back(this->set[i]);
}
}
return { result };
}
void Add(int64_t element) {
if (std::find(this->set.begin(), this->set.end(), element) == this->set.end()) {
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);
}
}
}
std::vector <int64_t> Data() {
return this->set;
}
void Print() {
for (auto temp : set) {
std::cout << temp << " ";
}
std::cout << std::endl;
}
};

(2 580 b)

0.046s 0.009s 10