Pagini recente » Cod sursa (job #3219228) | Cod sursa (job #2913315) | Cod sursa (job #1304027) | Cod sursa (job #2179633) | Cod sursa (job #2691355)
#include <bits/stdc++.h>
using namespace std;
#define MOD 666013
int n, tip, x;
class InParser {
private:
FILE *fin;
char *buff;
int sp;
char read_ch() {
++sp;
if (sp == 4096) {
sp = 0;
fread(buff, 1, 4096, fin);
}
return buff[sp];
}
public:
InParser(const char* nume){
fin = fopen(nume, "r");
buff = new char[4096]();
sp = 4095;
}
InParser& operator >> (int &n) {
char c;
while(!isdigit(c = read_ch()) && c != '-');
int sgn = 1;
if (c == '-'){
n = 0;
sgn = -1;
} else {
n = c - '0';
}
while(isdigit(c = read_ch())) {
n = n * 10 + c - '0';
}
n *= sgn;
return *this;
}
InParser& operator >> (long long &n) {
char c;
n = 0;
while(!isdigit(c = read_ch()) && c != '-');
long long sgn = 1;
if (c == '-'){
n = 0;
sgn = -1;
} else {
n = c - '0';
}
n *= sgn;
return *this;
}
};
class OutParser{
private:
FILE *fout;
char *buff;
int sp;
void write_ch(char ch) {
if (sp == 50000) {
fwrite(buff, 1, 50000, fout);
sp = 0;
buff[sp++] = ch;
} else {
buff[sp++] = ch;
}
}
public:
OutParser(const char* name){
fout = fopen(name, "w");
buff = new char[50000]();
sp = 0;
}
~OutParser() {
fwrite(buff, 1, sp, fout);
fclose(fout);
}
OutParser& operator << (int vu32) {
if (vu32 <= 9) {
write_ch(vu32 + '0');
} else {
(*this) << (vu32 / 10);
write_ch(vu32 % 10 + '0');
}
return *this;
}
OutParser& operator << (long long vu64) {
if (vu64 <= 9){
write_ch(vu64 + '0');
} else {
(*this) << (vu64 / 10);
write_ch(vu64 % 10 + '0');
}
return *this;
}
OutParser& operator << (char ch) {
write_ch(ch);
return *this;
}
OutParser& operator << (const char *ch){
while(*ch){
write_ch(*ch);
++ch;
}
return *this;
}
};
vector<int> G[MOD];
inline vector<int>::iterator find_value(int x)
{
int list = x % MOD;
vector<int>::iterator it;
for (it = G[list].begin(); it != G[list].end(); ++it){
if (*it == x){
return it;
}
}
return G[list].end();
}
inline void insert_value(int x)
{
int list = x % MOD;
if (find_value(x) == G[list].end()){
G[list].push_back(x);
}
}
inline void erase_value(int x)
{
int list = x % MOD;
vector<int>::iterator it = find_value(x);
if (it != G[list].end())
G[list].erase(it);
}
int main() {
InParser fin("hashuri.in");
OutParser fout("hashuri.out");
fin >> n;
for (int i=1;i<=n;i++){
fin >> tip >> x;
if (tip == 1){
insert_value(x);
} else if (tip == 2){
erase_value(x);
} else {
fout << (find_value(x) != G[x % MOD].end()) << '\n';
}
}
return 0;
}