BZOJ 3262: 陌上花开

三位偏序 cdq分治的经典题

#include<bits/stdc++.h>
using namespace std;
const int N=100001,M=N<<1;
inline int read()
{
    char ch=getchar(); int x=0,f=1;
    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;
}
struct node{int x,y,z,cnt,ans;}p[N];
bool cmpx(node x,node y)
{
    if(x.x!=y.x)return x.x<y.x;
    if(x.y!=y.y)return x.y<y.y;
    return x.z<y.z;
}
bool cmpy(node x,node y){return x.y==y.y?(x.z<y.z):(x.y<y.y);}
int n,tot,k,num[N],t[M];
void add(int x,int u){for(;x<=k;x+=x&-x)t[x]+=u;}
int query(int x){int s=0; for(;x;x-=x&-x)s+=t[x]; return s;}
void CDQ(int l,int r)
{
    if(l==r)
    {
        p[l].ans+=p[l].cnt-1;
        return;
    }
    int mid=(l+r)>>1;
    CDQ(l,mid),
    CDQ(mid+1,r);
    sort(p+l,p+mid+1,cmpy);
    sort(p+mid+1,p+r+1,cmpy);
    int i,j=l;
    for(i=mid+1;i<=r;i++)
    {
        for(;j<=mid&&p[j].y<=p[i].y;j++)add(p[j].z,p[j].cnt);
        p[i].ans+=query(p[i].z);
    }
    for(i=l;i<j;i++)add(p[i].z,-p[i].cnt);
}
int main()
{
    int i,j; n=read(),k=read();
    for(i=1;i<=n;i++)
        p[i]=(node){read(),read(),read(),1,1};
    sort(p+1,p+1+n,cmpx); tot=0;
    for(i=1;i<=n;i++)
    {
        if(i!=1&&p[i].x==p[i-1].x&&p[i].y==p[i-1].y&&p[i].z==p[i-1].z)p[tot].cnt++;
        else p[++tot]=p[i];
    }
    CDQ(1,tot);
    for(i=1;i<=tot;i++)num[p[i].ans]+=p[i].cnt;
    for(i=1;i<=n;i++)printf("%d\n",num[i]);
    return 0;
}