题解:
CDQ分治模板:
#include<bits/stdc++.h>
using namespace std;
struct aaa{
int x,y,z,id,hh;
}a[200001],b[200001],c[200001];
int n,m,f[200001],ans[200001];
bool cmp(aaa a,aaa b){
return a.x<b.x||a.x==b.x&&a.y<b.y||a.x==b.x&&a.y==b.y&&a.z<b.z;
}
void cdq2(int l,int r){
int i,mid,j,k;
if(l==r)return;
mid=(l+r)/2;
cdq2(l,mid);cdq2(mid+1,r);
int cnt=0;
for(i=l,j=l,k=mid+1;i<=r;i++){
if((k>r||b[j].z<=b[k].z)&&j<=mid){
c[i]=b[j++];
cnt+=c[i].hh;
}
else{
c[i]=b[k++];
if(!c[i].hh)f[c[i].id]+=cnt;
}
}
for(i=l;i<=r;i++)b[i]=c[i];
}
void cdq(int l,int r){
int i,mid,j,k;
if(l==r)return;
mid=(l+r)/2;
cdq(l,mid);cdq(mid+1,r);
for(i=l,j=l,k=mid+1;i<=r;i++){
if((k>r||a[j].y<=a[k].y)&&j<=mid){
b[i]=a[j++];
b[i].hh=1;
}
else{
b[i]=a[k++];
b[i].hh=0;
}
}
for(i=l;i<=r;i++)a[i]=b[i];
cdq2(l,r);
}
int main(){
int i;
scanf("%d%d",&n,&m);
for(i=1;i<=n;i++){scanf("%d%d%d",&a[i].x,&a[i].y,&a[i].z);a[i].id=i;}
sort(a+1,a+n+1,cmp);
for(i=n-1;i;i--)
if(a[i].x==a[i+1].x&&a[i].y==a[i+1].y&&a[i].z==a[i+1].z)f[a[i].id]=f[a[i+1].id]+1;
cdq(1,n);
for(i=1;i<=n;i++)++ans[f[i]];
for(i=0;i<n;i++)printf("%d\n",ans[i]);
}