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

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

ru en cn

5478004

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

Far Eastern FU: CODE Fathers

Время

10.10.2021 15:57<< 12.10.2021 23:32 (17 д. 09:23) 23:33>>

Обработка

23:32 ... 23:33 (6,34 сек.)

Файл

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

Турнир

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

Задача

C: Set

Набор тестов

Ограничения

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

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

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

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

set.h:6:  public: should be indented +1 space inside class Set  [whitespace/indent] [3]
set.h:24:  Missing space around colon in range-based for loop  [whitespace/forcolon] [2]
set.h:34:  Missing space around colon in range-based for loop  [whitespace/forcolon] [2]
set.h:42:  Missing space around colon in range-based for loop  [whitespace/forcolon] [2]
set.h:52:  Missing space around colon in range-based for loop  [whitespace/forcolon] [2]
set.h:71:  private: should be indented +1 space inside class Set  [whitespace/indent] [3]
Done processing set.h
Total errors found: 6

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

≡

#include <vector>
#include <algorithm>
#include <cstdint>

class Set {
public:
    Set() = default;

explicit Set(const std::vector<int64_t> &elements) : elements(elements) {}

void Add(int64_t new_element) {
        if (!this->Contains(new_element)) {
            elements.push_back(new_element);
            sort(elements.begin(), elements.end());
        }
    }

void Remove(int64_t old_element) {
        auto it = std::find(elements.begin(), elements.end(), old_element);
        elements.erase(it);
    }

bool Contains(int64_t element) const {
        for (const auto &item: elements) {
            if (item == element) {
                return true;
            }
        }
        return false;
    }

Set Union(const Set &second_set) const {
        Set result_set = second_set;
        for (const auto &item: elements) {
            result_set.Add(item);
        }
        return result_set;
    }

Set Intersection(const Set &second_set) const {
        Set result_set;
        for (auto item: elements) {
            if (second_set.Contains(item)) {
                result_set.Add(item);
            }
        }
        return result_set;
    }

Set Difference(const Set &second_set) const {
        Set result_set;
        for (auto item: elements) {
            if (!second_set.Contains(item)) {
                result_set.Add(item);
            }
        }
        return result_set;
    }

Set SymmetricDifference(const Set &second_set) const {
        Set result_set = second_set;
        result_set = this->Union(second_set);
        result_set = result_set.Difference(this->Intersection(second_set));
        return result_set;
    }

std::vector<int64_t> Data() {
        return elements;
    }

private:
    std::vector<int64_t> elements;
};

(1 874 b)

0.044s 0.010s 10