Cod sursa(job #2701867)
Utilizator | Popa Sebastian beingsebi | Data | 1 februarie 2021 23:40:01 |
---|---|---|---|
Problema | Hashuri | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.7 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream f("hashuri.in");
ofstream g("hashuri.out");
vector<int> v[260000];
int main()
{
int n;
f >> n;
for (int t, a; n; n--)
{
f >> t >> a;
int md = a >> 14;
auto it = find(v[md].begin(), v[md].end(), a);
if (t == 1)
{
if (it == v[md].end())
v[md].push_back(a);
}
else if (t == 2)
{
if (it != v[md].end())
v[md].erase(it);
}
else
{
if (it == v[md].end())
g << "0\n";
else
g << "1\n";
}
}
return 0;
}