Cod sursa(job #1146006)
Utilizator | Data | 18 martie 2014 17:07:28 | |
---|---|---|---|
Problema | Hashuri | Scor | 70 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.4 kb |
#include <fstream>
#include <map>
using namespace std;
ifstream f("hashuri.in");
ofstream g("hashuri.out");
map<long long,int> M;
int main()
{
int n,p,i;
long long k;
f>>n;
for(i=1;i<=n;i++)
{
f>>p>>k;
if(p==1) M[k]=i;
else if(p==2) M.erase(k);
else if(M.find(k)->second) g<<"1\n";
else g<<"0\n";
}
f.close();
g.close();
return 0;
}