Cod sursa(job #1233756)

Utilizator Andrei1998Andrei Constantinescu Andrei1998 Data 25 septembrie 2014 23:02:46
Problema Zoo Scor 90
Compilator cpp Status done
Runda Arhiva de probleme Marime 3.7 kb
#include <fstream>
#include <algorithm>
#include <vector>
#include <map>
#include <set>
#include <cstring>
#include <cctype>

#define NMAX 16005
#define MMAX 100005
#define lsb(x) ((x)&(-x))
using namespace std;

int aib[16005];
int marime;

inline void update(int i){
    for(;i<=marime;i+=lsb(i))
        aib[i]++;
}

inline int query(int i){
    int s=0;
    for(;i;i-=lsb(i))
        s+=aib[i];
    return s;
}

struct point{
    int x;
    int y;
}v[NMAX];

int ans[MMAX];
/*
//Parsare
ifstream cin("zoo.in");

char sir[6496005];
int lung,poz;

inline void cit(){
    cin.get(sir+1,6496005,'#');
    lung=strlen(sir+1);
    poz=1;
}

inline int extract(){
    while(poz<=lung && (!isdigit(sir[poz]) && sir[poz]!='-'))
        poz++;

    int semn=1;
    if(sir[poz]=='-'){
        semn=-1;
        poz++;
    }

    int rez=0;
    while(poz<=lung && isdigit(sir[poz])){
        rez*=10;
        rez+=(sir[poz++]-'0');
    }

    return (semn*rez);
}
*/
//End of Parsare
struct operatie
{
    int x,y;

    int tip;
    int poz;
}op[NMAX+4*MMAX];

bool operator<(const operatie &a,const operatie &b){
    if(a.x<b.x)
        return 1;
    if(a.x>b.x)
        return 0;

    return a.tip<b.tip;
}

int main()
{
    ios_base::sync_with_stdio(false);

    ifstream cin("zoo.in");
    ofstream cout("zoo.out");

    set<int> setx,sety;
    map<int,int> hartax;
    map<int,int> hartay;

    int n=0;
    //cit();

    cin>>n;
    //n=extract();

    //Normalizare
    setx.insert(-2000000005);
    setx.insert(2000000005);
    sety.insert(-2000000005);
    sety.insert(2000000005);

    for(int i=1;i<=n;i++){
        cin>>v[i].x>>v[i].y;
        //v[i].x=extract();
        //v[i].y=extract();

        setx.insert(v[i].x);
        sety.insert(v[i].y);
    }

    set<int>::iterator it;
    int i=1;
    for(it=setx.begin();it!=setx.end();it++,i++)
        hartax[*it]=i;

    i=1;
    for(it=sety.begin();it!=sety.end();it++,i++)
        hartay[*it]=i;

    for(int i=1;i<=n;i++){
        v[i].x=hartax[v[i].x];
        v[i].y=hartay[v[i].y];

        op[i].x=v[i].x;
        op[i].y=v[i].y;
    }
    //End of Normalizare

    int m=0;
    cin>>m;
    //m=extract();

    int x1,y1,x2,y2;
    map<int,int>::iterator itt;

    int poz=n;
    for(int i=1;i<=m;i++){
        cin>>x1>>y1>>x2>>y2;
        //x1=extract();
        //y1=extract();
        //x2=extract();
        //y2=extract();

        itt=hartay.lower_bound(y1);itt--;
        y1=itt->second;

        itt=hartay.upper_bound(y2);itt--;
        y2=itt->second;


        itt=hartax.lower_bound(x1);itt--;
        x1=itt->second;

        itt=hartax.upper_bound(x2);itt--;
        x2=itt->second;

        if(y1<=y2 && x1<=x2){
            //cout<<query(y1,y2,1,x2-1)-query(y1,y2,1,x1-1)<<'\n';
            op[++poz].poz=i;
            op[poz].tip=1;
            op[poz].x=x2;
            op[poz].y=y2;

            op[++poz].poz=i;
            op[poz].tip=1;
            op[poz].x=x1;
            op[poz].y=y1;

            op[++poz].poz=i;
            op[poz].tip=2;
            op[poz].x=x1;
            op[poz].y=y2;

            op[++poz].poz=i;
            op[poz].tip=2;
            op[poz].x=x2;
            op[poz].y=y1;
        }
    }

    sort(op+1,op+poz+1);

    marime=hartay.size()+1;
    for(int i=1;i<=poz;i++)
        if(!op[i].tip)
            update(op[i].y);
        else if(op[i].tip==1)
            ans[op[i].poz]+=query(op[i].y);
        else
            ans[op[i].poz]-=query(op[i].y);

    for(int i=1;i<=m;i++)
        cout<<ans[i]<<'\n';

    cin.close();
    cout.close();
    return 0;
}