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

登录课程 / 比赛任务参与者控制台模块编译器关键字排名表

ru en cn

5482089

User

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

Time

22:37<< 13.10.2021 22:38 (9天 02:54) 22:38>>

Processing

22:38 ... 22:38 (7,14 秒)

File

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

Contest

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

Problem

C: Set

Testset

Limits

Time: 1s Memory: 512Mb

Status [?]

CE	Compilation error

source | results

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 < v.size(); ++i) {
                 ~~^~~~~~~~~~
cc1plus: all warnings being treated as errors

[打印 | | ]

≡

#include <algorithm>
#include <vector>

class Set {
 private:
const int FlAG_SIZE = 10000000;

public:
std::vector<int64_t> s;
Set() {
}
Set& operator=(const Set& other) {
this->s = other.s;
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->s.push_back(v[i]);
}
}
std::sort(this->s.begin(), this->s.end());
}
Set Union(const Set& firstSet) {
std::vector<bool> flags(FlAG_SIZE, false);
std::vector<int64_t> newSet;
for (size_t i = 0; i < firstSet.s.size(); ++i) {
if (!flags[firstSet.s[i]]) {
newSet.push_back(firstSet.s[i]);
flags[firstSet.s[i]] = true;
}
}
for (size_t i = 0; i < this->s.size(); ++i) {
if (!flags[this->s[i]]) {
newSet.push_back(this->s[i]);
flags[this->s[i]] = true;
}
}
std::sort(newSet.begin(), newSet.end());
return { newSet };
}
Set Intersection(const Set& S) {
std::vector<int64_t> res;
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()) {
res.push_back(S.s[i]);
}
}
return { res };
}
Set Difference(const Set& firstSet) {
std::vector<int64_t> res;
for (size_t i = 0; i < firstSet.s.size(); ++i) {
if (std::find(this->s.begin(), this->s.end(), firstSet.s[i]) != this->s.end()) {
} else {
res.push_back(firstSet.s[i]);
}
}
return { res };
}
Set SymmetricDifference(const Set& S) {
std::vector<int64_t> res;
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]);
}
}
for (size_t i = 0; i < this->s.size(); ++i) {
if (std::find(S.s.begin(), S.s.end(), this->s[i]) != S.s.end()) {
} else {
res.push_back(this->s[i]);
}
}
return { res };
}
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 var : s) {
std::cout << var << " ";
}
std::cout << std::endl;
}
};

(2 326 b)

0.063s 0.009s 10