Pagini recente » Cod sursa (job #2447113) | Cod sursa (job #2251267) | Cod sursa (job #1363510) | Cod sursa (job #774404) | Cod sursa (job #327200)
Cod sursa(job #327200)
#include<stdio.h>
#include<vector>
#define mod 100001
using namespace std;
vector<int>::iterator find(int);
void insert(int);
void erase(int);
int n;
vector<int>g[mod];
int main()
{
int t,x;
freopen("hashuri.in","r",stdin);
freopen("hashuri.out","w",stdout);
scanf("%d",&n);
for(;n;n--)
{
scanf("%d %d",&t,&x);
if(t==1)
insert(x);
if(t==2)
erase(x);
if(t==3)
printf("%d\n",find(x)!=g[x%mod].end());
}
return 0;
}
vector<int>::iterator find(int x)
{
int l=x%mod;
vector<int>::iterator it;
for(it=g[l].begin();it!=g[l].end();it++)
if(*it==x)
return it;
return g[l].end();
}
void insert(int x)
{
int l=x%mod;
if(find(x)==g[l].end())
g[l].push_back(x);
}
void erase(int x)
{
int l=x%mod;
if(find(x)!=g[l].end())
g[l].erase(find(x));
}