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

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

ru en cn

5481787

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

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

Время

22:04<< 13.10.2021 22:05 (9 д. 02:21) 22:06>>

Обработка

22:05 ... 22:05 (13,52 сек.)

Файл

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

Турнир

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

Задача

C: Set

Набор тестов

Ограничения

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

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

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

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

set.h:47:  Lines should be <= 80 characters long  [whitespace/line_length] [2]
set.h:47:  Missing spaces around !=  [whitespace/operators] [3]
set.h:47:  Missing space after ,  [whitespace/comma] [3]
set.h:53:  Tab found; better to use spaces  [whitespace/tab] [1]
set.h:54:  Tab found; better to use spaces  [whitespace/tab] [1]
set.h:55:  Tab found; better to use spaces  [whitespace/tab] [1]
set.h:56:  Tab found; better to use spaces  [whitespace/tab] [1]
set.h:56:  Lines should be <= 80 characters long  [whitespace/line_length] [2]
set.h:57:  Tab found; better to use spaces  [whitespace/tab] [1]
set.h:58:  Tab found; better to use spaces  [whitespace/tab] [1]
set.h:59:  Tab found; better to use spaces  [whitespace/tab] [1]
set.h:60:  Tab found; better to use spaces  [whitespace/tab] [1]
set.h:61:  Tab found; better to use spaces  [whitespace/tab] [1]
set.h:62:  Tab found; better to use spaces  [whitespace/tab] [1]
set.h:63:  Tab found; better to use spaces  [whitespace/tab] [1]
set.h:64:  Tab found; better to use spaces  [whitespace/tab] [1]
set.h:65:  Tab found; better to use spaces  [whitespace/tab] [1]
set.h:65:  Lines should be <= 80 characters long  [whitespace/line_length] [2]
set.h:66:  Tab found; better to use spaces  [whitespace/tab] [1]
set.h:67:  Tab found; better to use spaces  [whitespace/tab] [1]
set.h:68:  Tab found; better to use spaces  [whitespace/tab] [1]
set.h:69:  Tab found; better to use spaces  [whitespace/tab] [1]
set.h:70:  Tab found; better to use spaces  [whitespace/tab] [1]
set.h:70:  Lines should be <= 80 characters long  [whitespace/line_length] [2]
set.h:71:  Tab found; better to use spaces  [whitespace/tab] [1]
set.h:72:  Tab found; better to use spaces  [whitespace/tab] [1]
set.h:73:  Tab found; better to use spaces  [whitespace/tab] [1]
set.h:74:  Tab found; better to use spaces  [whitespace/tab] [1]
set.h:75:  Tab found; better to use spaces  [whitespace/tab] [1]
set.h:76:  Tab found; better to use spaces  [whitespace/tab] [1]
set.h:77:  Tab found; better to use spaces  [whitespace/tab] [1]
set.h:77:  Lines should be <= 80 characters long  [whitespace/line_length] [2]
set.h:78:  Tab found; better to use spaces  [whitespace/tab] [1]
set.h:79:  Tab found; better to use spaces  [whitespace/tab] [1]
set.h:80:  Tab found; better to use spaces  [whitespace/tab] [1]
set.h:81:  Tab found; better to use spaces  [whitespace/tab] [1]
set.h:82:  Tab found; better to use spaces  [whitespace/tab] [1]
set.h:83:  Tab found; better to use spaces  [whitespace/tab] [1]
set.h:84:  Tab found; better to use spaces  [whitespace/tab] [1]
set.h:85:  Tab found; better to use spaces  [whitespace/tab] [1]
set.h:86:  Tab found; better to use spaces  [whitespace/tab] [1]
set.h:87:  Tab found; better to use spaces  [whitespace/tab] [1]
set.h:88:  Tab found; better to use spaces  [whitespace/tab] [1]
set.h:89:  Tab found; better to use spaces  [whitespace/tab] [1]
set.h:90:  Tab found; better to use spaces  [whitespace/tab] [1]
set.h:91:  Tab found; better to use spaces  [whitespace/tab] [1]
set.h:92:  Tab found; better to use spaces  [whitespace/tab] [1]
set.h:93:  Tab found; better to use spaces  [whitespace/tab] [1]
set.h:94:  Tab found; better to use spaces  [whitespace/tab] [1]
set.h:95:  Tab found; better to use spaces  [whitespace/tab] [1]
set.h:96:  Tab found; better to use spaces  [whitespace/tab] [1]
set.h:97:  Tab found; better to use spaces  [whitespace/tab] [1]
set.h:98:  Tab found; better to use spaces  [whitespace/tab] [1]
set.h:99:  Tab found; better to use spaces  [whitespace/tab] [1]
set.h:100:  Tab found; better to use spaces  [whitespace/tab] [1]
set.h:101:  Tab found; better to use spaces  [whitespace/tab] [1]
set.h:102:  Tab found; better to use spaces  [whitespace/tab] [1]
set.h:103:  Tab found; better to use spaces  [whitespace/tab] [1]
set.h:104:  Tab found; better to use spaces  [whitespace/tab] [1]
Done processing set.h
Total errors found: 59

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

≡

#include <vector>
#include <algorithm>

class Set {
 private:
    const int FLAGS = 10e9;

public:
    std::vector <int64_t> set;
    Set() {
    }
    Set& operator=(const Set& other) {
        this->set = other.set;
        return *this;
    }
    explicit Set(const std::vector<int64_t>& vec) {
        std::vector <bool> flags(FLAGS, false);
        for (int i = 0; i < vec.size(); i++) {
            if (!flags[vec[i]]) {
                flags[vec[i]] = true;
                this->set.push_back(vec[i]);
            }
        }
        sort(this->set.begin(), this->set.end());
    }
    Set Union(const Set& join_set) {
        std::vector <bool> flags(FLAGS, false);
        std::vector <int64_t> new_set;
        for (int i = 0; i < join_set.set.size(); i++) {
            if (!flags[join_set.set[i]]) {
                new_set.push_back(join_set.set[i]);
                flags[join_set.set[i]] = true;
            }
        }
        for (int i = 0; i < this->set.size(); i++) {
            if (!flags[this->set[i]]) {
                new_set.push_back(this->set[i]);
                flags[this->set[i]] = true;
            }
        }
        sort(new_set.begin(), new_set.end());
        return { new_set };
    }
Set Intersection(const Set& join_set) {
std::vector <int64_t> result;
for (int i = 0; i < join_set.set.size(); i++) {
    if (std::find(this->set.begin(),this->set.end(),join_set.set[i])!=this->set.end()) {
            result.push_back(join_set.set[i]);
        }
    }
return { result };
}
	Set Difference(const Set& join_set) {
		std::vector <int64_t> result;
		for (int i = 0; i < join_set.set.size(); i++) {
			if (std::find(this->set.begin(), this->set.end(), join_set.set[i]) == this->set.end()) {
				result.push_back(join_set.set[i]);
			}
		}
		return { result };
	}
	Set SymmetricDifference(const Set& join_set) {
		std::vector <int64_t> result;
		for (int i = 0; i < join_set.set.size(); i++) {
			if (std::find(this->set.begin(), this->set.end(), join_set.set[i]) == this->set.end()) {
				result.push_back(join_set.set[i]);
			}
		}
		for (int i = 0; i < this->set.size(); i++) {
			if (std::find(join_set.set.begin(), join_set.set.end(), this->set[i]) == join_set.set.end()) {
				result.push_back(this->set[i]);
			}
		}
		return { result };
	}
	void Add(int64_t element) {
		if (std::find(this->set.begin(), this->set.end(), element) == this->set.end()) {
			this->set.push_back(element);
		}
	}
	bool Contains(int64_t element) {
		for (int i = 0; i < this->set.size(); i++) {
			if (this->set[i] == element) {
				return true;
			}
		}
		return false;
	}
	void Remove(int64_t element) {
		for (int i = 0; i < this->set.size(); i++) {
			if (this->set[i] == element) {
				this->set.erase(this->set.begin() + i);
			}
		}
	}
	std::vector <int64_t> Data() {
		return this->set;
	}
	void Print() {
		for (auto temp : set) {
			std::cout << temp << " ";
		}
		std::cout << std::endl;
	}
};

(3 035 b)

0.064s 0.008s 10