bzoj4822 [Cqoi2017]老C的任务（离线+扫描线+离散化+树状数组/KD tree）

因为可以离线做，而且所有点一开始就给定，所以可以用扫描线+树状数组来做。如果强制在线，还可以用kd tree做。

#include <bits/stdc++.h>
using namespace std;
#define N 100010
#define ll long long
#define inf 0x3f3f3f3f
inline int read(){
    int x=0,f=1;char ch=getchar();
    while(ch<'0'||ch>'9'){if(ch=='-') f=-1;ch=getchar();}
    while(ch>='0'&&ch<='9') x=x*10+ch-'0',ch=getchar();
    return x*f;
}
int n,m,num=0,ax[N<<2],ay[N<<2];ll c[N<<2],ans[N<<1];
struct Point{
    int x,y,w;
}p[N];
struct que{
    int x,y1,y2,id;
}q[N<<1];
inline bool cmp(Point x,Point y){return x.x<y.x;}
inline bool cmp1(que x,que y){return x.x<y.x;}
inline void add(int x,int val){for(;x<=3e5;x+=x&-x) c[x]+=val;}
inline ll ask(int x){ll res=0;for(;x;x-=x&-x) res+=c[x];return res;}
int main(){
//  freopen("a.in","r",stdin);
    n=read();m=read();
    for(int i=1;i<=n;++i) ax[i]=p[i].x=read(),ay[i]=p[i].y=read(),p[i].w=read();
    sort(p+1,p+n+1,cmp);int nx=n,ny=n;
    for(int i=1;i<=m;++i){
        int x1=read(),y1=read(),x2=read(),y2=read();
        ax[++nx]=x1;ax[++nx]=x2;ay[++ny]=y1;ay[++ny]=y2;
        q[++num].x=x1;q[num].y1=y1;q[num].y2=y2;q[num].id=i;
        q[++num].x=x2;q[num].y1=y1;q[num].y2=y2;q[num].id=m+i;
    }sort(ax+1,ax+nx+1);sort(ay+1,ay+ny+1);
    nx=unique(ax+1,ax+nx+1)-ax-1;ny=unique(ay+1,ay+ny+1)-ay-1;
    for(int i=1;i<=n;++i){
        p[i].x=lower_bound(ax+1,ax+nx+1,p[i].x)-ax;
        p[i].y=lower_bound(ay+1,ay+ny+1,p[i].y)-ay;
    }for(int i=1;i<=num;++i){
        q[i].x=lower_bound(ax+1,ax+nx+1,q[i].x)-ax;
        q[i].y1=lower_bound(ay+1,ay+ny+1,q[i].y1)-ay;
        q[i].y2=lower_bound(ay+1,ay+ny+1,q[i].y2)-ay;
        if(q[i].id<=m) q[i].x--;
    }sort(q+1,q+num+1,cmp1);int pnum=1;num=1;
    for(int i=0;i<=3e5+1;++i){
        while(pnum<=n&&p[pnum].x==i) add(p[pnum].y,p[pnum].w),++pnum;
        while(num<=2*m&&q[num].x==i) ans[q[num].id]=ask(q[num].y2)-ask(q[num].y1-1),++num;
    }for(int i=1;i<=m;++i) printf("%lld\n",ans[m+i]-ans[i]);
    return 0;
}