2018SEERC Points and Rectangles (CDQ分治)

题：http://codeforces.com/gym/101964/problem/K

分析：https://blog.csdn.net/qq_43202683/article/details/98115901

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
inline int read(){
    int sum=,x=;
    char ch=getchar();
    while(ch<''||ch>''){
        if(ch=='-')
            x=;
        ch=getchar();
    }
    while(ch>=''&&ch<='')
        sum=(sum<<)+(sum<<)+(ch^),ch=getchar();
    return x?sum:-sum;
}
inline void write(ll x){
    if(x<)
        putchar('-'),x=-x;
    if(x>)
        write(x/);
    putchar(x%+'');
}
#define pb push_back
#define lowbit(x) (x&(-x))
const int M=5e5+;
int ans[M];
int tree[M];
void add(int i,int x){
    while(i<M)
        tree[i]+=x,i+=(i&(-i));
    return ;
}
int query(int i){
    int res=;
    while(i){
        res+=tree[i];
        i-=(i&(-i));
    }
    return res;
}
struct node{
    int x,y,op,id;
    bool operator <(const node &b)const{
        return id<b.id;
    }
}a[M],temp[M];
vector<pair<int, int> > book;
void cdq1(int l, int r)//算点对矩阵的贡献(小于等于)
{
    if(r-l<=) return;
    int midd = (r+l)>>;
    cdq1(l, midd);
    cdq1(midd, r);
    int i= l,j= midd,n = ;
    while(i< midd &&j< r){
        if(a[i].x <= a[j].x){
            if(a[i].op == ){
                add(a[i].y, );
                book.push_back(make_pair(a[i].y, ));
            }
            temp[n++] = a[i++];
        }
        else{
            if(a[j].op==){
                ans[a[j].id]+=query(a[j].y);
            }
            else if(a[j].op==)
                ans[a[j].id]-=query(a[j].y);
            temp[n++]=a[j++];
        }
    }
    while(i<midd)
        temp[n++] = a[i++];
    while(j<r){
        if(a[j].op == )
             ans[a[j].id] += query(a[j].y);
        else if(a[j].op == )
            ans[a[j].id] -= query(a[j].y);
        temp[n++]=a[j++];
    }
    for(i =l;i<r;++i)
        a[i]=temp[i - l];
    for(i = ; i <book.size(); ++i)
        add(book[i].first, -book[i].second);
    book.clear();
    return;
}
void cdq2(int l,int r)
{
    if(r-l<= )
        return;
    int midd=(l+r)>>;
    cdq2(l,midd);
    cdq2(midd,r);
    int i= l,j=midd,n=;
    while(i<midd&&j<r){
        if(a[i].x<a[j].x){
            if(a[i].op == ){
                add(a[i].y,);
                book.pb(make_pair(a[i].y, ));
            }
            else if(a[i].op==){
                add(a[i].y,-);
                book.pb(make_pair(a[i].y,-));
            }
            temp[n++]=a[i++];
        }
        else{
            if(a[j].op == ){
                ans[a[j].id] +=query(a[j].y-);
            }
            temp[n++]=a[j++];
        }
    }
    while(i<midd)
        temp[n++]=a[i++];//temp[o++] = e[lp++]?? = temp[lp++],debug???
    while(j<r){
        if(a[j].op == ) {
            ans[a[j].id] +=query(a[j].y - );
        }
        temp[n++]=a[j++];
    }
    for(i=l;i<r;i++)
        a[i]=temp[i-l];
    for(i=;i<book.size();i++)
        add(book[i].first,-book[i].second);
    book.clear();
    return;
}
int lisan[M<<];
int main(){
    int n=read();
    int tot=,num=;
    for(int i=;i<n;i++){
        int op=read();
        if(op==){
            a[tot].x=read(),a[tot].y=read();
            a[tot].op=,a[tot].id=i;
            lisan[++num]=a[tot].x,lisan[++num]=a[tot].y;
            tot++;
        }
        else{
            int x1=read(),y1=read(),x2=read(),y2=read();
            a[tot].op=,a[tot].x=x1-,a[tot].y=y1-,a[tot].id=i,tot++;
            a[tot].op=,a[tot].x=x2,a[tot].y=y2,a[tot].id=i,tot++;
            a[tot].op=,a[tot].x=x1-,a[tot].y=y2,a[tot].id=i,tot++;
            a[tot].op=,a[tot].x=x2,a[tot].y=y1-,a[tot].id=i,tot++;
            lisan[++num]=x1-,lisan[++num]=x2,lisan[++num]=y1-,lisan[++num]=y2;
        }
 
    }
    sort(lisan+,lisan+num+);
    int m=unique(lisan+,lisan++num)-lisan-;
    for(int i=;i<tot;i++){
        a[i].x=lower_bound(lisan+,lisan++m,a[i].x)-lisan;
        a[i].y=lower_bound(lisan+,lisan++m,a[i].y)-lisan;
//        cout<<a[i].x<<"~~~~"<<a[i].y<<endl;
    }
    cdq1(,tot);
 
    sort(a,a+tot);
    cdq2(,tot);
    ll ANS=0ll;
    for(int i=;i<n;i++){
        ANS+=ans[i];
        write(ANS);
        puts("");
    }
    return ;
}