Pagini recente » Cod sursa (job #2214558) | Cod sursa (job #2612930) | Cod sursa (job #2496395) | Cod sursa (job #710874) | Cod sursa (job #2418302)
#include <bits/stdc++.h>
using namespace std;
#define LIKELY(condition) __builtin_expect(static_cast<bool>(condition), 1)
#define UNLIKELY(condition) __builtin_expect(static_cast<bool>(condition), 0)
class parser {
public:
parser() {}
parser(const char *file_name)
{
input_file.open(file_name,ios::in | ios::binary);
input_file.sync_with_stdio(false);
index&=0;
input_file.read(buffer,SIZE);
}
inline parser &operator >>(int &n)
{
for (; buffer[index]<'0' or buffer[index]>'9'; inc());
n&=0;
//sign&=0;
//sign|=(buffer[index-1]=='-');
for (; '0'<=buffer[index] and buffer[index]<='9'; inc())
n=10*n+buffer[index]-'0';
//n^=((n^-n)&-sign);
return *this;
}
~parser()
{
input_file.close();
}
private:
fstream input_file;
static const int SIZE=0x400000; ///4MB
char buffer[SIZE];
int index/*,sign*/;
inline void inc()
{
if(++index==SIZE)
index=0,input_file.read(buffer,SIZE);
}
};
class writer {
public:
writer() {};
writer(const char *file_name)
{
output_file.open(file_name,ios::out | ios::binary);
output_file.sync_with_stdio(false);
index&=0;
}
inline writer &operator <<(bool target)
{
aux&=0;
/*sign=1;
if (target<0)
sign=-1;*/
n=target;
if (n==0)
nr[aux++]='0';
for (; n; n/=10)
nr[aux++]=/*(sign**/n/*)*/%10+'0';
/*if (sign==-1)
buffer[index]='-',inc();*/
for(; aux; inc())
buffer[index]=nr[--aux];
return *this;
}
inline writer &operator <<(const char *target)
{
aux&=0;
while (target[aux])
buffer[index]=target[aux++],inc();
return *this;
}
~writer()
{
output_file.write(buffer,index);
output_file.close();
}
private:
fstream output_file;
static const int SIZE=0x200000; ///2MB
int index,aux,n/*,sign*/;
char buffer[SIZE],nr[24];
inline void inc()
{
if(++index==SIZE)
index&=0,output_file.write(buffer,SIZE);
}
};
parser f ("hashuri.in");
writer t ("hashuri.out");
template <class Tkey, class Tinfo>
class hashtable {
public:
hashtable (){}; //C-TOR
void add(Tkey target_key, Tinfo target_info) {/*
set_index_to(target_key);
bool break_loop = false;
while(!break_loop) {
if (container[pointer].key == target_key) {
occupied[pointer] = true;
break_loop = true;
} else if (!occupied[pointer]) {
container[pointer].key = target_key;
container[pointer].info = target_info;
} else {
inc();
}
}
*/
set_index_to(target_key);
FLAG1:
if (container[pointer].key==target_key)
{
occupied[pointer]=true;
return;
}
else if (container[pointer].key==0)
container[pointer].key=target_key;
else
{
inc();
goto FLAG1;
}
}
void remov(Tkey target_key) {
set_index_to(target_key);
bool break_loop = false;
while(!break_loop) {
if (container[pointer].key == target_key) {
occupied[pointer] = false;
break_loop = true;
} else {
inc();
}
}
}
bool check(Tkey target_key) {
set_index_to(target_key);
bool break_loop = false;
while(!break_loop) {
if (container[pointer].key == target_key and occupied[pointer]) {
return true;
} else if (!occupied[pointer]) {
return false;
}
inc();
}
return false;
}
~hashtable () {}//D-TOR
private:
static const unsigned SIZE = 1048576, MOD = 1048575,
PRIME1 = 21313, PRIME2 = 19937, mask = 0xFFF00000;
struct data_cell {
Tkey key;
Tinfo info;
} container[SIZE];
unsigned pointer;
std::bitset <SIZE> occupied;
void inc()
{
if (UNLIKELY(++pointer == SIZE))
pointer &= 0;
}
void set_index_to(Tkey target) {/*
pointer = target & MOD;
pointer = (1LL * pointer * PRIME1) & MOD;
pointer = (1LL * pointer * PRIME2) & MOD;
target |= mask;
target >>= 16;
pointer ^= target;
pointer &= MOD;*/
pointer = target % MOD;
pointer = (1LL * pointer * PRIME1) % MOD;
pointer = (1LL * pointer * PRIME2) % MOD;
target |= mask;
target >>= 16;
pointer ^= target;
pointer %= MOD;
}
};
hashtable <int, bool> h;
void handle(int type, int target) {
if (type == 1)
h.add(target, true);
else if (type == 2)
h.remov(target);
else
t << h.check(target) << "\n";
}
int main() {
int n;
f >> n;
for (int op, target; n; --n)
f >> op >> target,
handle(op, target);
}