Pagini recente » Cod sursa (job #1204977) | Cod sursa (job #855913) | Cod sursa (job #2122029) | Cod sursa (job #2392614) | Cod sursa (job #2893638)
#include <iostream>
#include <vector>
#include <fstream>
using namespace std;
ifstream in("hashuri.in");
ofstream out("hashuri.out");
int n, p = 393919, i, x, op, hashedX, ok, j, vSize;
vector<vector<int>> hashMatrix(393919); //avem cate o lista pentru fiecare rest de la 0 la p - 1
int main()
{
in>>n;
for(i = 1; i <= n; i++)
{
in>>op>>x;
hashedX = x % p;
switch(op)
{
case 1:
hashMatrix[hashedX].push_back(x);
break;
case 2:
vSize = hashMatrix[hashedX].size();
for(j = 0; j < vSize; j++)
if(hashMatrix[hashedX][j] == x)
{
hashMatrix[hashedX][j] = hashMatrix[hashedX].back();
hashMatrix[hashedX].pop_back();
break;
}
break;
case 3:
ok = 0;
vSize = hashMatrix[hashedX].size();
for(j = 0; j < vSize; j++)
if(hashMatrix[hashedX][j] == x)
{
ok = 1;
break;
}
out<<ok<<endl;
break;
default:
break;
}
}
return 0;
}