Pagini recente » Cod sursa (job #590322) | Cod sursa (job #2397162) | Cod sursa (job #461761) | Cod sursa (job #2953297) | Cod sursa (job #1180125)
#include <fstream>
#include <vector>
using namespace std;
#define MOD 666013
ifstream f("hashuri.in");
ofstream g("hashuri.out");
int T, op, number;
vector<int> G[MOD];
inline int h(int x) {
x = ((x >> 16) ^ x) * 0x45d9f3b;
x = ((x >> 16) ^ x) * 0x45d9f3b;
x = ((x >> 16) ^ x);
return x % MOD;
}
inline vector<int>::iterator findValue(int number) {
int key = h(number);
for (auto it = G[key].begin(); it != G[key].end(); ++it)
if (*it == number)
return it;
return G[key].end();;
}
inline void insertValue(int number) {
int key = h(number);
if (findValue(number) == G[key].end())
G[key].push_back(number);
}
inline void eraseValue(int number) {
int key = h(number);
auto it = findValue(number);
if (it != G[key].end())
G[key].erase(it);
}
int main() {
for (f >> T; T; --T) {
f >> op >> number;
if (op == 1) insertValue(number);
else if (op == 2) eraseValue(number);
else g << (findValue(number) != G[h(number)].end()) << "\n";
}
}