Pagini recente » Cod sursa (job #693893) | Cod sursa (job #801348) | Cod sursa (job #1056003) | Cod sursa (job #1127124) | Cod sursa (job #1951436)
#include <bits/stdc++.h>
#define MOD (1 << 21)
using namespace std;
vector <int> Hash[MOD];
int n;
class Reader
{
public:
Reader() {}
Reader(const char *file_name)
{
input_file = fopen(file_name, "r");
cursor = 0;
fread(buffer, SIZE, 1, input_file);
}
inline Reader &operator >>(int &n)
{
while(buffer[cursor] < '0' || buffer[cursor] > '9')
{
advance();
}
n = 0;
while('0' <= buffer[cursor] && buffer[cursor] <= '9')
{
n = n * 10 + buffer[cursor] - '0';
advance();
}
return *this;
}
inline Reader &operator >>(char &n)
{
while(!((buffer[cursor] >= 'a' && buffer[cursor] <= 'z') || (buffer[cursor] >= 'A' && buffer[cursor] <= 'Z') ))
{
advance();
}
if( (buffer[cursor] >= 'a' && buffer[cursor] <= 'z') || (buffer[cursor] >= 'A' && buffer[cursor] <= 'Z'))
{
n=buffer[cursor] ;
advance();
}
return *this;
}
private:
FILE *input_file;
static const int SIZE = 1 << 17;
int cursor;
char buffer[SIZE];
inline void advance()
{
++ cursor;
if(cursor == SIZE)
{
cursor = 0;
fread(buffer, SIZE, 1, input_file);
}
}
};
class Writer
{
public:
Writer(const char *name):
m_stream(name)
{
memset(m_buffer, 0, sizeof(m_buffer));
m_pos = 0;
}
Writer& operator<<(int a)
{
int many = 0;
do
{
digit_buffer[many++] = a % 10 + '0';
a /= 10;
}
while (a > 0);
for (int i = many - 1; i >= 0; --i)
putchar(digit_buffer[i]);
return *this;
}
Writer& operator<<(const char *s)
{
for (; *s; ++s)
putchar(*s);
return *this;
}
~Writer()
{
m_stream.write(m_buffer, m_pos);
}
private:
void putchar(char c)
{
m_buffer[m_pos++] = c;
if (m_pos == kBufferSize)
{
m_stream.write(m_buffer, m_pos);
m_pos = 0;
}
}
static const int kBufferSize = 1 << 17;
ofstream m_stream;
char m_buffer[kBufferSize];
char digit_buffer[30];
int m_pos;
};
int query(int x)
{
auto it=find(Hash[x%MOD].begin(), Hash[x%MOD].end(),x);
if (it != Hash[x%MOD].end()) return 1;
return 0;
}
void addNumber(int x)
{
if(query(x)==0) Hash[x%MOD].push_back(x);
}
void removeNumber(int x)
{
auto it=find(Hash[x%MOD].begin(), Hash[x%MOD].end(),x);
if (it != Hash[x%MOD].end()) Hash[x%MOD].erase(it);
}
Reader f("hashuri.in");
Writer g("hashuri.out");
int main()
{
f>>n;
for(int i=1;i<=n;i++)
{
int t,x;
f>>t>>x;
switch(t)
{
case 1:
addNumber(x);
break;
case 2:
removeNumber(x);
break;
case 3:
g<<query(x)<<"\n";
break;
}
}
}