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

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

ru en cn

5465955

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

Костюков Максим Сергеевич

Время

10.10.2021 14:05 (25 д. 04:38) 14:06>>

Обработка

14:05 ... 14:05 (7,13 сек.)

Файл

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

Турнир

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

Задача

C: Set

Набор тестов

Ограничения

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

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

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

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

set.h:6:  Do not use namespace using-directives.  Use using-declarations instead.  [build/namespaces] [5]
set.h:11:  "public:" should be preceded by a blank line  [whitespace/blank_line] [3]
set.h:14:  Missing space around colon in range-based for loop  [whitespace/forcolon] [2]
set.h:46:  Missing space around colon in range-based for loop  [whitespace/forcolon] [2]
set.h:54:  Missing space around colon in range-based for loop  [whitespace/forcolon] [2]
set.h:64:  Missing space around colon in range-based for loop  [whitespace/forcolon] [2]
set.h:74:  Missing space around colon in range-based for loop  [whitespace/forcolon] [2]
set.h:81:  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>
#include <cinttypes>
#include <algorithm>

using namespace std;

class Set {
 private:
  vector<int64_t> data;
 public:
  Set() = default;
  explicit Set(const vector<int64_t> &data) {
    for (auto elem: data) {
      if (find(this->data.begin(), this->data.end(), elem)
          != this->data.end()) {
        this->data.push_back(elem);
      }
    }
  }
  void Add(int64_t element) {
    if (find(this->data.begin(), this->data.end(), element)
        != this->data.end()) {
      this->data.push_back(element);
    }
  }

void Remove(int64_t element) {
    auto iter = find(this->data.begin(), this->data.end(), element);
    if (iter != this->data.end()) {
      this->data.erase(iter);
    }
  }

[[nodiscard]] bool Contains(int64_t element) const {
    return find(this->data.begin(), this->data.end(), element)
        != this->data.end();
  }

[[nodiscard]] vector<int64_t> Data() const {
    return data;
  }

[[nodiscard]] Set Union(const Set &set) const {
    Set newSet(Data());
    for (auto elem: set.Data()) {
      newSet.Add(elem);
    }
    return newSet;
  }

[[nodiscard]] Set Intersection(const Set &set) const {
    Set newSet;
    for (auto elem: set.Data()) {
      if (Contains(elem)) {
        newSet.Add(elem);
      }
    }
    return newSet;
  }

[[nodiscard]] Set Difference(const Set &set) const {
    Set newSet;
    for (auto elem: Data()) {
      if (!set.Contains(elem)) {
        newSet.Add(elem);
      }
    }
    return newSet;
  }

[[nodiscard]] Set SymmetricDifference(const Set &set) const {
    Set newSet = Difference(set);
    for (auto elem: set.Data()) {
      if (!Contains(elem)) {
        newSet.Add(elem);
      }
    }
    return newSet;
  }

};

(1 835 b)

0.050s 0.010s 10