miptalgo2015/Hash.cpp at master · mamaevads/miptalgo2015 · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
//#define _CRT_SECURE_NO_WARNINGS

#include <algorithm>
#include <iostream>
#include <vector>
#include <random>
#include <stdio.h>

using namespace std;

default_random_engine generator;

int generateRandom(int minx, int maxx) {
	uniform_int_distribution<int> distribution(minx, maxx);
	return distribution(generator);
}

class Hash {

public:
	static const unsigned long long MOD = 2000000011;
	unsigned long long a;
	unsigned long long b;
	int sizeOfTable;

public:
	void newAB()
	{
		a = generateRandom(1, MOD - 1);
		b = generateRandom(0, MOD - 1);
	}

	void setSize(int size)
	{
		sizeOfTable = size;
	}

	long long operator()(int key) const
	{
		return (((a * key)  + b) % MOD) % sizeOfTable;
	}
};


class InnerSet {

private:
	Hash hash;

	int sizeOfSet;
	vector <bool> set;
	vector <int> val;

	bool isBad(const vector<int> &numbers) {
		sizeOfSet = numbers.size() * numbers.size();
		hash.setSize(sizeOfSet);
		set.assign(sizeOfSet, false);
		val.assign(sizeOfSet, 0);
		for (auto const &element : numbers) {
			int cur = hash(element);
			if (set[cur]) {
				return true;
			}
			val[cur] = element;
			set[cur] = true;
		}
		return false;
	}

public:

	explicit InnerSet(const vector<int> &numbers) {
		do {
			hash.newAB();
		} while (isBad(numbers));
		val.resize(sizeOfSet * sizeOfSet);
		for (auto const &element : numbers) {
			val[hash(element)] = element;
		}
	}

	bool Contains(int element) const {
		return sizeOfSet && set[hash(element)] && val[hash(element)] == element;
	}
};

class FixedSet {

private:
	Hash hash;
	vector <InnerSet> InnerSets;
	int sizeOfTable;

	bool isBad(const vector<int> &numbers, vector <vector <int> >& innernumbers) {
		sizeOfTable = numbers.size();
		hash.setSize(sizeOfTable);
		innernumbers.assign(sizeOfTable, vector<int>());
		for (auto const &element : numbers) {
			innernumbers[hash(element)].push_back(element);
		}
		long long squareSetSize = 0;
		for (auto const &tablenumbers : innernumbers) {
			squareSetSize += (long long)tablenumbers.size() * (long long)tablenumbers.size();
		}
		return (squareSetSize > 4 * sizeOfTable);
	}

public:

	explicit FixedSet(const vector <int> &numbers) {
		vector <vector <int> > innernumbers;
		do {
			hash.newAB();
		} while (isBad(numbers, innernumbers));
		InnerSets.clear();

		for (auto const &innerElement : innernumbers) {
			InnerSets.push_back(InnerSet(innerElement));
		}
	}

	bool Contains(int number) const {
		return InnerSets[hash(number)].Contains(number);
	}
};

int main() {
	std::ios_base::sync_with_stdio(false);
	//freopen("test21-00006.txt", "r", stdin);
	//freopen("out3.txt", "w", stdout);
	int n, m, now;
	cin >> n;
	vector <int> numbers(n);
	for (size_t i = 0; i < n; i++) {
		cin >> numbers[i];
	}
	cin >> m;
	vector<bool> answers(m);
	FixedSet helper = FixedSet(numbers);
	for (size_t i = 0; i < m; i++) {
		cin >> now;
		answers[i] = helper.Contains(now);
	}
	for (size_t i = 0; i < m; i++) {
		cout << (answers[i] ? "Yes\n" : "No\n");
	}
}