Pagini recente » Cod sursa (job #3222317) | Cod sursa (job #2616386) | Cod sursa (job #1005869) | Cod sursa (job #310521) | Cod sursa (job #728739)
Cod sursa(job #728739)
#include<iostream>
#include<fstream>
#include<vector>
using namespace std;
int n,x,y;
vector<int> z[666014];
int cauta(int xx,int ii,int nn)
{
int k;
for(k=0;k<nn;k++)
if(z[ii][k]==xx)
return k;
return -1;
}
int main()
{
freopen("hashuri.in","r",stdin);
freopen("hashuri.out","w",stdout);
scanf("%d",&n);
int i,k,p,q,nr;
for(i=1;i<=n;i++)
{
scanf("%d%d",&x,&y);
p=y%666013;
nr=z[p].size();
if(x==1)
{
if(cauta(y,p,nr)==-1)
z[p].push_back(y);
}
else
if(x==2)
{
q=cauta(y,p,nr);
if(q!=-1)
{
for(k=q+1;k<nr;k++)
z[p][k-1]=z[p][k];
z[p].pop_back();
}
}
else
if(cauta(y,p,nr)!=-1)
printf("1\n");
else
printf("0\n");
}
return 0;
}