Pagini recente » Cod sursa (job #1936772) | Cod sursa (job #223572) | Istoria paginii runda/test_icrisop_2/clasament | Cod sursa (job #132066) | Cod sursa (job #1573703)
#include<fstream>
#include<vector>
#define mod 975275
using namespace std;
int n, i, op, x;
vector<int> G[mod+2];
vector<int>::iterator it;
vector<int>::iterator find_value(int x)
{
int listt=x%mod;
for(it=G[listt].begin(); it!=G[listt].end(); it++)
if(*it==x)
return it;
return G[listt].end();
}
void insert_value(int x)
{
int listt=x%mod;
if(find_value(x)==G[listt].end())
G[listt].push_back(x);
return ;
}
void erase_value(int x)
{
int listt=x%mod;
vector<int>::iterator it=find_value(x);
if(it!=G[listt].end())
G[listt].erase(it);
}
ifstream in("hashuri.in");
ofstream out("hashuri.out");
int main()
{
in>>n;
for(i=1; i<=n; i++)
{
in>>op>>x;
if(op==1)
{
insert_value(x);
continue;
}
if(op==2)
{
erase_value(x);
continue;
}
find_value(x)==G[x%mod].end()?out<<"0\n":out<<"1\n";
}
return 0;
}