Mai intai trebuie sa te autentifici.
Cod sursa(job #2747991)
Utilizator | Data | 29 aprilie 2021 19:50:52 | |
---|---|---|---|
Problema | Hashuri | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.8 kb |
#include <fstream>
#include <vector>
using namespace std;
const int mod = 666013;
int N, op;
int i;
vector<int> v[mod];
int findv(int x)
{
int x_h = x % mod;
int l = v[x_h].size();
for (i = 0; i < l; i++)
if (v[x_h][i] == x)
return 1;
return 0;
}
void insertv(int x)
{
int x_h = x % mod;
if (findv(x) == 0)
v[x_h].push_back(x);
}
void deletev(int x)
{
int x_h = x % mod;
int l = v[x_h].size();
for (i = 0; i < l; i++)
if (v[x_h][i] == x)
{
v[x_h][i] = v[x_h][l - 1];
v[x_h].pop_back();
break;
}
}
int main()
{
ifstream f("hashuri.in");
ofstream o("hashuri.out");
int x;
f >> N;
for (i = 0; i < N; i++)
{
f >> op >> x;
if (op == 1)
insertv(x);
else if (op == 2)
deletev(x);
else
o << findv(x) << endl;
}
}