Mai intai trebuie sa te autentifici.
Cod sursa(job #732258)
| Utilizator | Data | 9 aprilie 2012 23:09:47 | |
|---|---|---|---|
| Problema | Hashuri | Scor | 30 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.82 kb |
#include <fstream>
#include <vector>
#define max 700001
using namespace std;
vector<int> sir[max];
int len = 0;
vector<int>::iterator pozitia(int nr){
vector<int>::iterator i;
for (i=sir[nr % max].begin(); i!=sir[nr % max].end(); i++)
if (nr = *i) return i;
return sir[nr % max].end();
}
int main(){
int n, op, nr;
ifstream in("hashuri.in");
ofstream out("hashuri.out");
in>>n;
for (int i=0; i<n; i++){
in>>op>>nr;
if (op == 1){
if (pozitia(nr) == sir[nr % max].end()) sir[nr % max].push_back(nr);
}
else if (op == 2){
vector<int>::iterator j;
j=pozitia(nr);
if (j != sir[nr % max].end()) sir[nr % max].erase(j);
}
else if (op == 3){
if (pozitia(nr) == sir[nr % max].end()) out<<"0\n";
else out<<"1\n";
}
}
in.close();
out.close();
return 0;
}