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

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

ru en cn

5451778

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

Смирнов Михаил Александрович

Время

06.10.2021 23:19 (21 д. 13:52) 23:20>>

Обработка

23:19 ... 23:19 (6,76 сек.)

Файл

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

Турнир

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

Задача

C: Set

Набор тестов

Ограничения

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

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

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

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

set.h:8:  Missing space around colon in range-based for loop  [whitespace/forcolon] [2]
set.h:8:  Use int16/int64/etc, rather than the C type long  [runtime/int] [4]
set.h:19:  Missing space around colon in range-based for loop  [whitespace/forcolon] [2]
set.h:19:  Use int16/int64/etc, rather than the C type long  [runtime/int] [4]
set.h:36:  Missing space around colon in range-based for loop  [whitespace/forcolon] [2]
set.h:36:  Use int16/int64/etc, rather than the C type long  [runtime/int] [4]
set.h:119:  Could not find a newline character at the end of the file.  [whitespace/ending_newline] [5]
Done processing set.h
Total errors found: 7

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

≡

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

explicit Set(const std::vector<int64_t> &v) {
    for (long i: v)
      Add(i);
  }
  Set() = default;

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

void Add(int64_t number) {
    bool is_new = true;
    for (long i: this->v)
      if (number == i) {
        is_new = false;
        break;
      }
    if (is_new) this->v.push_back(number);
  }

void Remove(int64_t number) {
    for (unsigned 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 (long i: this->v)
      if (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;
    new_v.reserve(this_size);
    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) 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().size() > other.Data().size()
                    ? Data() : other.Data();
    auto other_set = Data().size() < other.Data().size()
                     ? 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();
    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 044 b)

0.115s 0.010s 10