Pagini recente » Cod sursa (job #3136791) | Cod sursa (job #369216) | Cod sursa (job #2363659) | Cod sursa (job #1811443) | Cod sursa (job #2422253)
#include<fstream>
#include<vector>
using namespace std;
const int MOD = 666013;
vector<int> G[MOD];
inline vector<int>::iterator find_value(int x) {
int list = x % MOD;
vector<int>::iterator it;
for (it = G[list].begin(); it != G[list].end(); ++it)
if (*it == x)
return it;
return G[list].end();
}
inline void insert_value(int x) {
int list = x % MOD;
if (find_value(x) == G[list].end())
G[list].push_back(x);
}
inline void erase_value(int x) {
int list = x % MOD;
vector<int>::iterator it=find_value(x);
if(it!=G[list].end())
G[list].erase(it);
}
int main(){
ifstream fin("hashuri.in");
ofstream fout("hashuri.out");
int op,x,N;
fin>>N;
for(int i=0;i<N;++i)
{
fin>>op>>x;
if(op==1) {
insert_value(x);
}else if(op==2){
erase_value((x));
}
else{
fout<<(find_value(x)!=G[x%MOD].end())<<"\n";
}
}
fin.close();
fout.close();
return 0;
}