Cod sursa(job #2309081)
| Utilizator | Data | 28 decembrie 2018 13:54:04 | |
|---|---|---|---|
| Problema | Hashuri | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.68 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("hashuri.in");
ofstream fout("hashuri.out");
int i,j,m,n,a,b,r;
vector<int> t[1000004];
int main()
{
fin>>n;
r=1000001;
a=3;
for (i=1;i<=n;i++)
{
fin>>a>>b;
int nr=b%r;
m=1;
for (j=0;j<t[nr].size();j++)
if (t[nr][j]==b) {m=0; break;}
if (a==1)
if (m)
t[nr].push_back(b);
if (a==2)
if (j!=t[nr].size())
t[nr][j]=-1;
if (a==3)
if (j!=t[nr].size()) fout<<1<<"\n";
else fout<<0<<"\n";
}
return 0;
}
