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

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

ru en cn

5481850

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

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

Время

22:12<< 13.10.2021 22:12 (9 д. 02:29) 22:14>>

Обработка

22:12 ... 22:12 (6,82 сек.)

Файл

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

Турнир

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

Задача

C: Set

Набор тестов

Ограничения

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

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

CE	Ошибка компиляции

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

In file included from main.cpp:16:0:
set.h: In constructor 'Set::Set(const std::vector<long int>&)':
set.h:18:19: error: comparison between signed and unsigned integer expressions [-Werror=sign-compare]
 for (int i = 0; i < vec.size(); i++) {
                 ~~^~~~~~~~~~~~
set.h: In member function 'Set Set::Union(const Set&)':
set.h:29:19: error: comparison between signed and unsigned integer expressions [-Werror=sign-compare]
 for (int i = 0; i < join_set.S.size(); i++) {
                 ~~^~~~~~~~~~~~~~~~~~~
set.h:35:19: error: comparison between signed and unsigned integer expressions [-Werror=sign-compare]
 for (int i = 0; i < this->S.size(); i++) {
                 ~~^~~~~~~~~~~~~~~~
set.h:41:6: error: 'new_S' was not declared in this scope
 sort(new_S.begin(), new_S.end());
      ^~~~~
set.h:41:1: error: 'sort' was not declared in this scope
 sort(new_S.begin(), new_S.end());
 ^~~~
set.h:41:1: note: suggested alternative:
In file included from /usr/include/c++/7/algorithm:62:0,
                 from main.cpp:5:
/usr/include/c++/7/bits/stl_algo.h:4856:5: note:   'std::sort'
     sort(_RandomAccessIterator __first, _RandomAccessIterator __last,
     ^~~~
In file included from main.cpp:16:0:
set.h:42:18: error: converting to 'Set' from initializer list would use explicit constructor 'Set::Set(const std::vector<long int>&)'
 return { new_set };
                  ^
set.h: In member function 'Set Set::Intersection(const Set&)':
set.h:46:21: error: 'join_set' was not declared in this scope
 for (int i = 0; i < join_set.S.size(); i++) {
                     ^~~~~~~~
set.h:46:21: note: suggested alternative: 'fd_set'
 for (int i = 0; i < join_set.S.size(); i++) {
                     ^~~~~~~~
                     fd_set
set.h:51:17: error: converting to 'Set' from initializer list would use explicit constructor 'Set::Set(const std::vector<long int>&)'
 return { result };
                 ^
set.h: In member function 'Set Set::Difference(const Set&)':
set.h:55:19: error: comparison between signed and unsigned integer expressions [-Werror=sign-compare]
 for (int i = 0; i < join_set.S.size(); i++) {
                 ~~^~~~~~~~~~~~~~~~~~~
set.h:60:17: error: converting to 'Set' from initializer list would use explicit constructor 'Set::Set(const std::vector<long int>&)'
 return { result };
                 ^
set.h: In member function 'Set Set::SymmetricDifference(const Set&)':
set.h:64:19: error: comparison between signed and unsigned integer expressions [-Werror=sign-compare]
 for (int i = 0; i < s.S.size(); i++) {
                 ~~^~~~~~~~~~~~
set.h:69:19: error: comparison between signed and unsigned integer expressions [-Werror=sign-compare]
 for (int i = 0; i < this->S.size(); i++) {
                 ~~^~~~~~~~~~~~~~~~
set.h:74:17: error: converting to 'Set' from initializer list would use explicit constructor 'Set::Set(const std::vector<long int>&)'
 return { result };
                 ^
set.h: In member function 'bool Set::Contains(int64_t)':
set.h:82:19: error: comparison between signed and unsigned integer expressions [-Werror=sign-compare]
 for (int i = 0; i < this->S.size(); i++) {
                 ~~^~~~~~~~~~~~~~~~
set.h: In member function 'void Set::Remove(int64_t)':
set.h:90:19: error: comparison between signed and unsigned integer expressions [-Werror=sign-compare]
 for (int i = 0; i < this->S.size(); i++) {
                 ~~^~~~~~~~~~~~~~~~
cc1plus: all warnings being treated as errors

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

≡

#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;
}
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->S.push_back(vec[i]);
}
}
sort(this->S.begin(), this->S.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.S.size(); i++) {
if (!flags[join_set.S[i]]) {
new_set.push_back(join_set.S[i]);
flags[join_set.S[i]] = true;
}
}
for (int i = 0; i < this->S.size(); i++) {
if (!flags[this->S[i]]) {
new_set.push_back(this->S[i]);
flags[this->S[i]] = true;
}
}
sort(new_S.begin(), new_S.end());
return { new_set };
}
Set Intersection(const Set& s) {
std::vector <int64_t> result;
for (int i = 0; i < join_set.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& join_set) {
std::vector <int64_t> result;
for (int i = 0; i < join_set.S.size(); i++) {
if (std::find(this->S.begin(), this->S.end(), join_set.S[i]) == this->S.end()) {
result.push_back(join_set.S[i]);
}
}
return { result };
}
Set SymmetricDifference(const Set& s) {
std::vector <int64_t> result;
for (int 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 (int i = 0; i < this->S.size(); i++) {
if (std::find(s.S.begin(), s.S.end(), this->S[i]) == s.S.end()) {
result.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()) {
this->S.push_back(element);
}
}
bool Contains(int64_t element) {
for (int i = 0; i < this->S.size(); i++) {
if (this->S[i] == element) {
return true;
}
}
return false;
}
void Remove(int64_t element) {
for (int 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 405 b)

0.048s 0.008s 10