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

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

ru en cn

5420222

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

Пиляй Николай Владимирович

Время

23:49<< 29.09.2021 23:49 (14 д. 14:22) 23:49>>

Обработка

23:49 ... 23:49 (7.06 сек.)

Файл

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

Турнир

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

Задача

C: Set

Набор тестов

Ограничения

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

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

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

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

set.h:6:  Redundant blank line at the start of a code block should be deleted.  [whitespace/blank_line] [2]
set.h:7:  public: should be indented +1 space inside class Set  [whitespace/indent] [3]
set.h:15:  Missing space before {  [whitespace/braces] [5]
set.h:16:  Redundant blank line at the start of a code block should be deleted.  [whitespace/blank_line] [2]
set.h:16:  Redundant blank line at the end of a code block should be deleted.  [whitespace/blank_line] [3]
set.h:27:  { should almost always be at the end of the previous line  [whitespace/braces] [4]
set.h:34:  { should almost always be at the end of the previous line  [whitespace/braces] [4]
set.h:36:  { should almost always be at the end of the previous line  [whitespace/braces] [4]
set.h:42:  Line ends in whitespace.  Consider deleting these extra spaces.  [whitespace/end_of_line] [4]
set.h:43:  { should almost always be at the end of the previous line  [whitespace/braces] [4]
set.h:48:  { should almost always be at the end of the previous line  [whitespace/braces] [4]
set.h:52:  { should almost always be at the end of the previous line  [whitespace/braces] [4]
set.h:60:  { should almost always be at the end of the previous line  [whitespace/braces] [4]
set.h:65:  { should almost always be at the end of the previous line  [whitespace/braces] [4]
set.h:73:  { should almost always be at the end of the previous line  [whitespace/braces] [4]
set.h:77:  { should almost always be at the end of the previous line  [whitespace/braces] [4]
set.h:79:  Lines should be <= 80 characters long  [whitespace/line_length] [2]
set.h:85:  { should almost always be at the end of the previous line  [whitespace/braces] [4]
set.h:89:  { should almost always be at the end of the previous line  [whitespace/braces] [4]
set.h:93:  Lines should be <= 80 characters long  [whitespace/line_length] [2]
set.h:97:  Could not find a newline character at the end of the file.  [whitespace/ending_newline] [5]
Done processing set.h
Total errors found: 21

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

≡

#pragma once
#include <iostream>
#include <vector>

class Set {

public:
std::vector<int64_t> v;

Set(const std::vector<int64_t>& v) {
for (int i = 0; i < v.size(); i++)
Add(v[i]);
}

Set(){

}

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

void Add(int64_t val)
    {
        if (Contains(val))
            return;
        this->v.push_back(val);
    }

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

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

Set Union(const Set& v) const
    {
        std::vector<int64_t> un_v1 = this->Data();
        std::vector<int64_t> un_v2 = v.Data();
        for (int i = 0; i < un_v2.size(); i++)
        {
            if (!Contains(un_v2[i]))
                un_v1.push_back(un_v2[i]);
        }
        return un_v1;
    }

Set Intersection(const Set& v) const
    {
        std::vector<int64_t> un_v1 = this->Data();
        std::vector<int64_t> un_v2 = v.Data();
        std::vector<int64_t> un_v3;
        for (int i = 0; i < un_v2.size(); i++)
        {
            if (Contains(un_v2[i]))
                un_v3.push_back(un_v2[i]);
        }
        return un_v3;
    }

Set Difference(const Set& v) const
    {
        std::vector<int64_t> un_v1 = this->Data();
        std::vector<int64_t> un_v2 = v.Data();
        for (int i = 0; i < un_v2.size(); i++)
        {
            if (Contains(un_v2[i]))
                un_v1.erase(std::remove(un_v1.begin(), un_v1.end(), un_v2[i]), un_v1.end());
        }
        return un_v1;
    }

Set SymmetricDifference(const Set& v) const
    {
        std::vector<int64_t> un_v1 = this->Data();
        std::vector<int64_t> un_v2 = v.Data();
        for (int i = 0; i < un_v2.size(); i++)
        {
            if (!Contains(un_v2[i]))
                un_v1.push_back(un_v2[i]);
            else
                un_v1.erase(std::remove(un_v1.begin(), un_v1.end(), un_v2[i]), un_v1.end());
        }
        return un_v1;
    }
};

(2 289 b)

0.121s 0.020s 10