Cod sursa(job #2469341)
| Utilizator | Data | 6 octombrie 2019 19:51:53 | |
|---|---|---|---|
| Problema | Hashuri | Scor | 70 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.66 kb |
#include <fstream>
#include <iostream>
#include <stdio.h>
#include <unordered_map>
using namespace std;
ifstream fin("hashuri.in");
ofstream fout("hashuri.out");
unordered_map <int, int> mMap;
int queries;
int main()
{
int type, param;
fin >> queries;
for(int i = 0 ; i < queries; i++)
{
fin >> type >> param;
if(type == 1)
mMap[param] = 1;
if(type == 2)
mMap.erase(param);
if(type == 3)
{
if(mMap.find(param) != mMap.end())
fout << 1 << "\n";
else
fout << 0 << "\n";
}
}
return 0;
}