Cod sursa(job #1773771)

Utilizator StarGold2Emanuel Nrx StarGold2 Data 8 octombrie 2016 10:53:29
Problema Walls Scor 100
Compilator cpp Status done
Runda Arhiva de probleme Marime 4.55 kb
#include <bits/stdc++.h>
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;
    }
} in( "walls.in" );

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;
    }
} out( "walls.out" );

const int DIM = 1e5 + 5;
const int INF = 0x3f3f3f3f;

int h[DIM], w[DIM], t[DIM * 4];
map<pair<int, int>, int> mm; long long xs[DIM];

void bld( int n, int l, int r ) {
    if( l > r ) return;

    if( l == r ) {
        t[n] = l;
        return;
    }

    int m = l + (r - l) / 2;

    bld( n * 2, l, m );
    bld( n * 2 + 1, m + 1, r );

    if( h[ t[n * 2] ] > h[ t[n * 2 + 1] ] )
        t[n] = t[n * 2];
    else
        t[n] = t[n * 2 + 1];

    return;
}

void upd( int n, int l, int r, int p ) {
    if( l > r || l > p || r < p ) return;

    if( l == r ) {
        t[n] = l;
        return;
    }

    int m = l + (r - l) / 2;

    upd( n * 2, l, m, p );
    upd( n * 2 + 1, m + 1, r, p );

    if( h[ t[n * 2] ] > h[ t[n * 2 + 1] ] )
        t[n] = t[n * 2];
    else
        t[n] = t[n * 2 + 1];

    return;
}

int qry( int n, int l, int r, int st, int fi, int p ) {
    if( l > r || l > fi || r < st ) return -1;

    if( st <= l && r <= fi ) {
        if( h[ t[n] ] < p )
            return -1;

        if( l == r )
            return t[n];
    }

    int m = l + (r - l) / 2;

    int ans = qry( n * 2 + 1, m + 1, r, st, fi, p );

    if( ans == -1 )
        ans = qry( n * 2, l, m, st, fi, p );

    return ans;
}

int bs( int l, int r, int p ) {

    while( l <= r ) {
        int m = l + (r - l) / 2;

        if( xs[m] <= p )
            l = m + 1;
        else
            r = m - 1;
    }

    return r;
}

int main( int argc, const char *argv[] ) {

    int n; in >> n; h[0] = INT_MIN;

    for( int i = 1; i <= n; i ++ ) {
        in >> w[i] >> h[i];
        xs[i] = xs[i - 1] + w[i] + 1;
    }

    bld( 1, 1, n );

    int m; in >> m;

    for( int i = 1; i <= m; i ++ ) {
        int x, y; in >> x >> y;

        int ans = qry( 1, 1, n, 1, bs( 1, n, x ), y );

        if( ans == -1 )
            out << "MISS" << "\n";
        else {
            mm[ make_pair(ans, y) ] ++;
            out << "HIT" << " " << xs[ans] - mm[ make_pair(ans, y) ] << " " << ans << " ";

            if( mm[ make_pair(ans, y) ] == w[ans] ) {
                h[ans] = y - 1; upd( 1, 1, n, ans );
                out << "YES" << "\n";
            } else
                out << "NO" << "\n";
        }
    }

    return 0;
}