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

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

ru en cn

5481932

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

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

Время

22:18<< 13.10.2021 22:25 (9 д. 02:41) 22:26>>

Обработка

22:25 ... 22:25 (5,99 сек.)

Файл

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

Турнир

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

Задача

C: Set

Набор тестов

Ограничения

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

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

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

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

set.h:57:  { should almost always be at the end of the previous line  [whitespace/braces] [4]
set.h:59:  An else should appear on the same line as the preceding }  [whitespace/newline] [4]
set.h:59:  If an else has a brace on one side, it should have it on both  [readability/braces] [5]
set.h:74:  { should almost always be at the end of the previous line  [whitespace/braces] [4]
set.h:76:  An else should appear on the same line as the preceding }  [whitespace/newline] [4]
set.h:76:  If an else has a brace on one side, it should have it on both  [readability/braces] [5]
set.h:84:  { should almost always be at the end of the previous line  [whitespace/braces] [4]
set.h:86:  An else should appear on the same line as the preceding }  [whitespace/newline] [4]
set.h:86:  If an else has a brace on one side, it should have it on both  [readability/braces] [5]
Done processing set.h
Total errors found: 9

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

≡

#include <vector>
#include <algorithm>

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

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

(2 401 b)

0.046s 0.009s 10