Cod sursa(job #1467271)
Utilizator | Data | 3 august 2015 09:19:12 | |
---|---|---|---|
Problema | Hashuri | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.48 kb |
#include <fstream>
#include <map>
#include <unordered_map>
using namespace std;
ifstream f("hashuri.in");
ofstream g("hashuri.out");
int N,K;
//map <int, int> H;
unordered_map<int, int> H;
int main()
{
f>>N;
for(int i=1;i<=N;++i)
{
int tip,x;
f>>tip>>x;
if (tip==1 && H.find(x)==H.end()) H[x] = ++K;
if (tip==2) H.erase(x);
if (tip==3) g<<(H.find(x)!=H.end())<<'\n';
}
f.close();g.close();
return 0;
}