Cod sursa(job #2497646)
Utilizator | Data | 23 noiembrie 2019 09:26:30 | |
---|---|---|---|
Problema | Hashuri | Scor | 70 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.54 kb |
#include <fstream>
#include <unordered_map>
using namespace std;
ifstream cin("hashuri.in");
ofstream cout("hashuri.out");
int n,x,c;
unordered_map <int,int> m;
int main()
{
cin>>n;
for(int i=1;i<=n;i++)
{
cin>>c>>x;
if(c==1)
m[x]++;
else if(c==2)
{
if(m[x]>0)
m[x]--;
}
else
{
if(m[x]==0)
cout<<0<<'\n';
else
cout<<1<<'\n';
}
}
return 0;
}