Cod sursa(job #2626245)
| Utilizator | Data | 6 iunie 2020 12:47:46 | |
|---|---|---|---|
| Problema | Hashuri | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.96 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("hashuri.in");
ofstream fout("hashuri.out");
vector<int> v[999983];
int p,x;
bool verif(int hasu)
{
for(int i=0; i<v[hasu].size(); i++)
if (v[hasu][i]==x)
{
p=i;
return 1;
}
return 0;
}
int main()
{
int n,m,op,nr,rez;
fin>>n;
for (int i=1; i<=n; i++)
{
p=0;
fin>>op>>x;
nr=x%999983;
if (op==1)
{
rez=verif(nr);
if (rez==0)
{
v[nr].push_back(x);
}
}
if (op==2)
{
rez=verif(nr);
if (rez==1)
{
v[nr][p]=v[nr][v[nr].size()-1];
v[nr].pop_back();
}
}
if (op==3)
{
rez=verif(nr);
fout<<rez<<"\n";
}
}
return 0;
}
