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

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

ru en cn

5400765

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

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

Время

12:50<< 20.09.2021 12:52 (5 д. 03:25) 13:58>>

Обработка

12:52 ... 12:52 (2,88 сек.)

Файл

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

Турнир

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

Задача

C: Set

Набор тестов

Ограничения

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

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

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

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

set.h:12:  public: should be indented +1 space inside class Set  [whitespace/indent] [3]
set.h:13:  Single-parameter constructors should be marked explicit.  [runtime/explicit] [5]
set.h:25:  private: should be indented +1 space inside class Set  [whitespace/indent] [3]
set.h:38:  Lines should be <= 80 characters long  [whitespace/line_length] [2]
set.h:57:  Missing space around colon in range-based for loop  [whitespace/forcolon] [2]
set.h:65:  Missing space around colon in range-based for loop  [whitespace/forcolon] [2]
set.h:73:  Missing space around colon in range-based for loop  [whitespace/forcolon] [2]
set.h:76:  Missing space around colon in range-based for loop  [whitespace/forcolon] [2]
Done processing set.h
Total errors found: 8

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

≡

#pragma once

#include <vector>
#include <algorithm>

using std::copy;
using std::vector;
using std::find;
using std::sort;

class Set {
public:
    Set(vector<int64_t> list)

vector<int64_t> Data()
    Add(int64_t value)
    Remove(int64_t value)
    bool Contains(int64_t value)

Set Union(Set other)
    Set Intersection(Set other)
    Set Difference(Set other)
    Set SymmetricDifference(Set other)

private:
    vector<int64_t> list;

int Index(int64_t value)
}

Set::Set(vector<int64_t> list) {
  copy(list.begin(), list.end(), this->list);
}

vector<int64_t> Set::Data() { return this->list; }

auto Set::Index(int64_t value) {
  vector<int64_t>::iterator idx = find(this->list.begin(), this->list.end(), value);
  return idx;
}
Set::Add(int64_t value) {
  this->list.pushback(value)
}
Set::Remove(int64_t value) {
  this->list.erase(this->Index(value));
}

Set::Union(Set other) {
  vector<int64_t> res;
  res.reserve(this->list.size() + this->list.size());
  res.insert(res.end(), this->list.begin(), this->list.end() );
  res.insert(res.end(), other.Data().begin(), other.Data().end());
  return Set(res);
}
Set::Intersection(Set other) {
  vector<int64_t> res;
  for (auto k: other.Data())
    if (this->Contains(k))
      res.pushback(k);
  sort(res);
  return Set(res);
}
Set::Difference(Set other) {
  vector<int64_t> res;
  for (auto k: other.Data())
    if (!this->Contains(k))
      res.pushback(k);
  sort(res);
  return Set(res);
}
Set::SymmetricDifference(Set other) {
  vector<int64_t> res;
  for (auto k: other.Data())
    if (!this->Contains(k))
      res.pushback(k);
  for (auto k: this->list)
    if (!other.Contains(k))
      res.pushback(k);
  sort(res);
  return Set(res);
}

bool Set::Contains(int64_t value) {
  if (this->Index(value) == this->list.end())
    return false;
  return true;
}

(1 922 b)

0.066s 0.009s 10