Cod sursa(job #2465543)
Utilizator | Data | 30 septembrie 2019 12:09:49 | |
---|---|---|---|
Problema | Hashuri | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.7 kb |
#include <bits/stdc++.h>
#define mod 666666
using namespace std;
ifstream fin ("hashuri.in");
ofstream fout ("hashuri.out");
vector <int> v[mod];
vector <int> :: iterator j;
int n, i, h, x, t;
int main()
{
fin >> n;
for(i=1;i<=n;i++)
{
fin >> t >> x;
h=x%mod;
for(j=v[h].begin(); j!=v[h].end() && *j!=x; ++j);
if(j==v[h].end())
{
if(t==3)
fout << 0 << '\n';
else if(t==1)
v[h].push_back(x);
}
else
{
if(t==3)
fout << 1 << '\n';
else if(t==2)
v[h].erase(j);
}
}
return 0;
}