Cod sursa(job #2485367)
Utilizator | Data | 1 noiembrie 2019 13:52:42 | |
---|---|---|---|
Problema | Hashuri | Scor | 70 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.5 kb |
//#include <iostream>
#include <bits/stdc++.h>
using namespace std;
ifstream in("hashuri.in");
ofstream out("hashuri.out");
unordered_map <int,bitset<1> >m;
int n;
int main()
{
in>>n;
for(int i=1;i<=n;i++)
{
int x,y; in>>x>>y;
if(x==1)
m[y]=1;
else if(x==2)
m.erase(y);
else
{
if(m[y]==1)
out<<1<<"\n";
else
out<<"0"<<"\n";
}
}
return 0;
}