Cod sursa(job #1961466)
Utilizator | Data | 11 aprilie 2017 09:52:32 | |
---|---|---|---|
Problema | Hashuri | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 1.28 kb |
#include <fstream>
#include <vector>
#define MOD 666013
using namespace std;
ifstream f("hashuri.in");
ofstream g("hashuri.out");
int n, i, j, tip, x, ok, poz;
vector <int> v[MOD];
int main()
{
f>>n;
for( i = 1; i <= n; ++ i)
{
f>>tip>>x;
if( tip == 1 )
{
poz=x%MOD;
ok = 1;
for( j = 0; j < v[poz].size(); ++ j)
if( v[poz][j] == x )
ok = 0;
if( ok == 1 )
v[poz].push_back(x);
}
if( tip == 2 )
{
poz = x % MOD;
ok = 0;
for( j = 0; j < v[poz].size(); ++ j)
if( v[poz][j] == x )
{
ok = 1;
break;
}
if( ok == 1 )
{
swap(v[poz][j],v[poz][v[poz].size()-1]);
v[poz].pop_back();
}
}
if( tip == 3 )
{
poz = x % MOD;
ok = 0;
for( j = 0; j < v[poz].size(); ++ j)
if( v[poz][j] == x )
{
ok = 1;
break;
}
g<<ok<<'\n';
}
}
return 0;
}