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

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

ru en cn

5408345

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

Новожилов Илья Сергеевич

Время

25.09.2021 18:42 (10 д. 09:16) 18:46>>

Обработка

18:42 ... 18:42 (10,24 сек.)

Файл

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

Турнир

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

Задача

C: Set

Набор тестов

Ограничения

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

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

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

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

set.h:4:  public: should be indented +1 space inside class Set  [whitespace/indent] [3]
set.h:8:  Single-parameter constructors should be marked explicit.  [runtime/explicit] [5]
set.h:21:  Missing space before ( in if(  [whitespace/parens] [5]
set.h:26:  Lines should be <= 80 characters long  [whitespace/line_length] [2]
set.h:87:  Line ends in whitespace.  Consider deleting these extra spaces.  [whitespace/end_of_line] [4]
set.h:90:  Missing space before ( in if(  [whitespace/parens] [5]
set.h:105:  Missing space before ( in if(  [whitespace/parens] [5]
set.h:115:  Redundant blank line at the end of a code block should be deleted.  [whitespace/blank_line] [3]
Done processing set.h
Total errors found: 8

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

≡

#include <iostream>
#include <vector>
class Set {
public:
    std::vector<int64_t> v;

Set(const std::vector<int64_t>& v) {
        this->v = v;
    }

std::vector<int64_t> Data() const {
        return this->v;
    }

void Add(int64_t number) {
       bool is_new = true;
       for (int i = 0; i < this->v.size(); i++)
           if (number == this->v[i]) { is_new = false; break; }
      if(is_new) this->v.push_back(number);
    }

void Remove(int64_t number) {
        for (int i = 0; i < this->v.size(); i++)
            if (this->v[i] == number) { this->v.erase(this->v.begin() + i); break;}
    }

bool Contains(int64_t number) const {
        for (int i = 0; i < this->v.size(); i++)
            if (this->v[i] == number) return true;
        return false;
    }

Set Union(const Set& other) const {
        auto this_set = Data();
        auto other_set = other.Data();
        int size_other = other_set.size();
        int this_size = this_set.size();
        std::vector<int64_t> new_v;
        bool is_new = true;
        for (int i = 0; i < this_size; i++)
            new_v.push_back(this_set[i]);
        for (int i = 0; i < size_other; i++) {
            is_new = true;
            for (int j = 0; j < this_size; j++) {
                if (other_set[i] == this_set[j]) {
                    is_new = false;
                    break;
                }
            }
            if (is_new == true) new_v.push_back(other_set[i]);
        }
        return Set(new_v);
    }

Set Intersection(const Set& other) const {
        auto this_set = Data();
        auto other_set = other.Data();
        int size_other = other_set.size();
        int this_size = this_set.size();
        std::vector<int64_t> new_v;
        for (int i = 0; i < this_size; i++) {
            for (int j = 0; j < size_other; j++) {
                if (other_set[j] == this_set[i]) {
                    new_v.push_back(this_set[i]);
                    break;
                }
            }
        }
        return Set(new_v);
    }

Set Difference(const Set& other) const {
        auto this_set = Data() > other.Data() ? Data() : other.Data();
        auto other_set = Data() < other.Data() ? Data() : other.Data();
        int size_other = other_set.size();
        int this_size = this_set.size();
        bool is_different = true;
        std::vector<int64_t> new_v;
        for (int i = 0; i < this_size; i++) {
            is_different = true;
            for (int j = 0; j < size_other; j++) {
                if (other_set[j] == this_set[i]) { 
is_different = false; break; }
            }
            if(is_different)
                new_v.push_back(this_set[i]);
        }

return Set(new_v);
    }

Set SymmetricDifference(const Set& other) const {
        auto this_set = Data();
        auto other_set = other.Data();
        int size_other = other_set.size();
        int this_size = this_set.size();
        bool is_different = true;
        std::vector<int64_t> new_v;
        for (int i = 0; i < this_size; i++) {
            if(!other.Contains(this_set[i])) new_v.push_back(this_set[i]);
        }
        for (int i = 0; i < size_other; i++) {
            if (!Contains(other_set[i])) new_v.push_back(other_set[i]);
        }
        return Set(new_v);
    }

};

(3 445 b)

0.063s 0.009s 10