Cod sursa(job #1813144)

Utilizator CiurezAndreiCiurez Marius-Andrei CiurezAndrei Data 22 noiembrie 2016 18:57:10
Problema Hashuri Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 4.32 kb
#include <bits/stdc++.h>

#define Lch (1 << 19) - 1

using namespace std;

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 = 10 * n + 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';
        }
        while (isdigit(c = read_ch())) {
            n = 10 * 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;
    }
};

struct Hash{

    int data;
    Hash *next;
    Hash *before;

}*L[Lch + 1];

inline bool hashFind(const int &x)
{
    int cheie = x & Lch;
    Hash *p;

    for(p = L[cheie]; p; p = p -> next)
    {
        if( p -> data == x )
        {
            return true;
        }
    }
    return false;
}

inline void hashInsert(const int &x)
{
    int cheie = x & Lch;
    Hash *p;
   if(hashFind(x) == false)
   {
        p = new Hash;
        p -> data = x;
        p -> next = L[cheie];
        p -> before = NULL;
        if(L[cheie] != NULL)
        {
            L[cheie] -> before = p;
        }
        L[cheie] = p;
   }
}

inline void hashErase(const int &x)
{
    int cheie = x & Lch;
    Hash *p;

    for(p = L[cheie]; p; p = p -> next)
    {
        if( p -> data == x )
        {
            if(p -> before != NULL)
            {
                (p -> before) -> next = p -> next;
            }
            else
            {
                L[cheie] = p -> next;
            }
            delete p;
            break;
        }
    }
}

int main()
{
    InParser fin("hashuri.in");
    OutParser fout("hashuri.out");
    int n;
    fin >> n;

    for(int i = 1; i <= n; i ++)
    {
        int op;
        int x;
        fin >> op;

        if(op == 1)
        {
            fin >> x;
            hashInsert(x);
        }
        else
            if(op == 2)
            {
                fin >> x;
                hashErase(x);
            }
            else
            {
                fin >> x;
                if(hashFind(x) == true)
                {
                    fout << "1" << '\n';
                }
                else
                {
                    fout << "0" << '\n';
                }
            }
    }
    return 0;
}