【cdq分治】P3810 三维偏序（陌上花开）

CDQ分治的模板题
暴力一些用树套树也可以写

#include<bits/stdc++.h>
#define mid (l+r)/2
using namespace std;
typedef long long ll;

const int NN=400100;
const int inf=0x3f3f3f3f;
ll n,m,k,x,y,z,q,W,T,N,cnt,tmp,dst,cas,val,tot,num;
int c[NN],ans[NN];

struct node{
    int x,y,z,val,num;
    void input(){
        cin>>x>>y>>z;
        val=0;num=1;
    }
    bool operator <(const node a)const{
        return x==a.x?(y==a.y?z<a.z:y<a.y):x<a.x;
    }
    bool operator ==(const node a)const{
        return x==a.x&&y==a.y&&z==a.z;
    }
};

node a[NN],p[NN],goal[NN];

void update(int i,int val){while(i<=k) c[i]+=val,i+=i&-i;}
ll query(int i){ll res=0;while(i) res+=c[i],i-=i&-i;return res;}

void cdq_merge(int l,int r){
    if(l==r) return ;
    cdq_merge(l,mid);cdq_merge(mid+1,r);
    int i=l,j=mid+1,now=l;
    while(i<=mid&&j<=r){
        if(goal[j].y<goal[i].y) goal[j].val+=query(goal[j].z),p[now++]=goal[j++];
        else update(goal[i].z,goal[i].num),p[now++]=goal[i++];
    }
    while(i<=mid) update(goal[i].z,goal[i].num),p[now++]=goal[i++];
    while(j<=r) goal[j].val+=query(goal[j].z),p[now++]=goal[j++];
    for(int i=l;i<=mid;i++) update(goal[i].z,-goal[i].num);
    for(int i=l;i<=r;i++) goal[i]=p[i];
}


int main(){
    ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
    //freopen("testdata.txt","r",stdin);
    cin>>n>>k;
    for(int i=1;i<=n;i++){a[i].input();}
    sort(a+1,a+n+1);
    for(int i=1;i<=n;i++){

        if(a[i]==goal[num]) goal[num].num++;
        else goal[++num]=a[i];
    }
    cdq_merge(1,num);
    //for(int i=1;i<=num;i++) cout<<goal[i].x<<' '<<goal[i].y<<' '<<goal[i].z<<' '<<goal[i].val<<endl;
    for(int i=1;i<=num;i++) ans[goal[i].val+goal[i].num]+=goal[i].num;
    for(int i=1;i<=n;i++) cout<<ans[i]<<'\n';
}