Pagini recente » Cod sursa (job #1757611) | Cod sursa (job #3166737) | Cod sursa (job #2518839) | Cod sursa (job #1708326) | Cod sursa (job #2911259)
#include <bits/stdc++.h>
using namespace std;
ifstream f("hashuri.in");
ofstream g("hashuri.out");
const int h = 100007;
vector<int> v[h];
int n, x, i;
int16_t op;
int main()
{
f >> n;
for (; n; n--){
f >> op >> x;
int k = x % h;
int s = v[k].size();
for (i = 0; i < s; i++){
if (v[k][i] == x) break;
}
switch(op){
case 1:
if (i == s) v[k].push_back(x);
break;
case 2:
if (i != s) {
swap(v[k][i], v[k][s - 1]);
v[k].pop_back();
}
break;
default:
if (i == s) g << "0\n";
else g << "1\n";
}
}
return 0;
}