Pagini recente » Clasament grigoremoisil2008 | Cod sursa (job #2158987) | Cod sursa (job #1963423) | Cod sursa (job #342021) | Cod sursa (job #1311352)
#include<iostream>
#include<fstream>
using namespace std;
int n,op,a[1000000],c[1000000],i,j;
long long b[1000000],s,w;
int main()
{
ifstream f("hashuri.in");
ofstream g("hashuri.out");
f>>n;
for(op=1;op<=n;op++)
{
f>>op;
if(op==1)
{
n++; f>>b[n];
if(a[b[n]]==0)
{a[b[n]]=1;
c[b[n]]=n;}
else n--;
}
if(op==2)
{
f>>s;
if(a[s]==1)
{a[s]=0;
for(j=c[s];j<=n;j++)
b[j]=b[j-1];
n--;
}
}
if(op==3)
{
f>>w;
if(a[w]==1) g<<1<<endl;
else g<<0<<endl;
}
}
f.close();
g.close();
return 0;
}