Cod sursa(job #2313981)
Utilizator | Data | 7 ianuarie 2019 18:22:11 | |
---|---|---|---|
Problema | Hashuri | Scor | 70 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.45 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream f("hashuri.in");
ofstream g("hashuri.out");
int N,op,x;
unordered_map < int,bool > mymap;
int main()
{
f>>N;
for(int i=1;i<=N;i++)
{
f>>op>>x;
if(op==1)
{
if(mymap[x]==0) mymap[x]=1;
}
else
if(op==2)
{
if(mymap[x]==1) mymap[x]=0;
}
else g<<mymap[x]<<'\n';
}
return 0;
}