Cod sursa(job #2885576)
| Utilizator | Data | 6 aprilie 2022 11:38:17 | |
|---|---|---|---|
| Problema | Hashuri | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 1.27 kb |
#include <iostream>
#include <fstream>
#include <vector>
using namespace std;
ifstream f("hashuri.in");
ofstream g("hashuri.out");
int k=666013,n,j,l,x,a,ok;
vector<vector<int>> h(k+3);
int main()
{
f>>n;
for(j=1;j<=n;j++)
{
f>>l>>x;
if(l==1)
{
ok=0;
for(int i=0;i<h[x % k].size()&&ok==0;i++)
{
if(h[x%k][i]==x)
{
ok=1;
}
}
if(ok==0)
{
h[x % k].push_back(x);
}
}
if(l==2)
{
for(int i=0;i<h[x % k].size();i++)
{
if(h[x%k][i]==x)
{
a=h[x%k][i];
h[x%k][i]=h[x%k][h[x % k].size()-1];
h[x%k][h[x % k].size()-1]=a;
h[x%k].pop_back();
}
}
}
if(l==3)
{
ok=0;
for(int i=0;i<h[x % k].size()&&ok==0;i++)
{
if(h[x%k][i]==x)
{
ok=1;
}
}
g<<ok<<'\n';
}
}
return 0;
}
