BZOJ 1935: [Shoi2007]Tree 园丁的烦恼 [树状数组 离线 离散化]

传送门

---

刚才我还在郁闷网上怎么没人用$CDQ$分治做

突然发现根本没有时间序....

#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cmath>
using namespace std;
const int N=3e6+;
inline int read(){
    char c=getchar();int x=,f=;
    while(c<''||c>''){if(c=='-')f=-; c=getchar();}
    while(c>=''&&c<=''){x=x*+c-''; c=getchar();}
    return x*f;
}
int n,Q,c[N],mp[N];
int m,qid;
struct Operation{
    int x,y,v,id;
    int qid,op;
    Operation():op(){}
    Operation(int x,int y,int v,int id,int qid,int op):
        x(x),y(y),v(v),id(id),qid(qid),op(op){}
    bool operator <(const Operation &r)const{
        return x==r.x?op<r.op:x<r.x;
    }
}a[N];
void devideQuery(){
    int x1=read()-,y1=read()-,x2=read(),y2=read();
    mp[++mp[]]=y1;mp[++mp[]]=y2;
    qid++;
    m++;a[m]=Operation(x2,y2,,m,qid,);
    m++;a[m]=Operation(x1,y2,-,m,qid,);
    m++;a[m]=Operation(x2,y1,-,m,qid,);
    m++;a[m]=Operation(x1,y1,,m,qid,);
}
void iniMP(){
    sort(mp+,mp++mp[]);
    int p=;
    mp[++p]=mp[];
    for(int i=;i<=mp[];i++) if(mp[i]!=mp[i-]) mp[++p]=mp[i];
    mp[]=p;
}
int Bin(int v){
    int l=,r=mp[];
    while(l<=r){
        int mid=(l+r)>>;
        if(v==mp[mid]) return mid;
        else if(v<mp[mid]) r=mid-;
        else l=mid+;
    }
    return ;
}
inline int lowbit(int x){return x&-x;}
void add(int p,int v){for(;p<=n;p+=lowbit(p)) c[p]+=v;}
int sum(int p){
    int re=;
    for(;p;p-=lowbit(p)) re+=c[p];
    return re;
}
int ans[N];
void solve(){
    for(int i=;i<=m;i++){
        if(!a[i].op) add(a[i].y,);
        else ans[a[i].qid]+=a[i].v*sum(a[i].y);
    }
    for(int i=;i<=Q;i++) printf("%d\n",ans[i]);
}
int main(){
    freopen("in","r",stdin);
    n=read();Q=read();
    for(int i=;i<=n;i++) a[++m].x=read(),mp[++mp[]]=a[m].y=read();
    for(int i=;i<=Q;i++) devideQuery();
    iniMP();
    for(int i=;i<=m;i++) a[i].y=Bin(a[i].y);
    sort(a+,a++m);
    solve();
}