Mai intai trebuie sa te autentifici.
Cod sursa(job #1952729)
| Utilizator | Data | 4 aprilie 2017 12:39:41 | |
|---|---|---|---|
| Problema | Hashuri | Scor | 70 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.86 kb |
#include <fstream>
#include <vector>
#define MOD 666013
using namespace std;
ifstream f ("hashuri.in");
ofstream g ("hashuri.out");
int n,a,b,poz;
vector <int> v[MOD+3];
int caut(int);
void bag(int);
void scot(int);
int usu(int t)
{
return t%MOD;
}
void bag(int t)
{
int p=usu(t);
if(caut(t)==-1) v[p].push_back(t);
}
void scot(int t)
{
int p=usu(t);
if(caut(t)>=0)
{
v[p].erase(v[p].begin()+poz,v[p].begin()+poz+1);
}
}
int caut(int t)
{
int p=usu(t);
for(int i=0;i<v[p].size();++i) if(v[p][i]==t) return poz;
return -1;
}
int main()
{
f>>n;
for(int i=1;i<=n;++i)
{
f>>a>>b;
if(a==1) bag(b);
else if(a==2) scot(b);
else if(a==3)
{
if(caut(b)==-1) g<<0<<'\n';
else g<<1<<'\n';
}
}
return 0;
}
