bzoj 3262: 陌上花开

没开权限就想做的一个题，今天终于…2333
排序一维，归并一维，树状数组一维；

#include<bits/stdc++.h>
#define rep(i,k,n) for(int i=k;i<=(n);i++)
using namespace std;
const int maxn=200005;
struct F{
    int d1,d2,d3,ans,s;F(){ans=0;s=1;}
}q[maxn],f[maxn];
int ans[maxn],tr[maxn],n,k,top=0,N;
void add(int x,int d){for(;x<maxn;x+=(x&-x))tr[x]+=d;}
int query(int x){int res=0;for(;x;x-=(x&-x))res+=tr[x];return res;}
bool cmp_1(F a,F b){return (a.d1==b.d1 && a.d2==b.d2) ? a.d3<b.d3 : (a.d1==b.d1 ? a.d2<b.d2 : a.d1<b.d1);}
bool cmp_2(F a,F b){return a.d2==b.d2 ? a.d3<b.d3 : a.d2<b.d2;}
bool operator == (F a,F b){return a.d1==b.d1 && a.d2==b.d2 && a.d3==b.d3;}
void cdq(int l,int r){
    if(l>=r)return;
    int mid=(l+r)>>1;
    cdq(l,mid);cdq(mid+1,r);
    int i=l,j=mid+1;
    while(j<=r){
        while(i<=mid && q[i].d2<=q[j].d2){
            add(q[i].d3,q[i].s);
            i++;
        }
        q[j].ans+=query(q[j].d3);
        j++;
    }
    rep(k,l,i-1)add(q[k].d3,-q[k].s);
    sort(q+l,q+r+1,cmp_2);
}

int main(){//freopen("in.in","r",stdin);
    scanf("%d%d",&N,&k);
    rep(i,1,N)scanf("%d%d%d",&f[i].d1,&f[i].d2,&f[i].d3);
    sort(f+1,f+1+N,cmp_1);
    rep(i,1,N){
        if(i<N && f[i]==f[i+1])f[i+1].s+=f[i].s;
        else q[++top]=f[i];
    }
    n=top;
    cdq(1,n);
    rep(i,1,n)ans[q[i].ans+q[i].s-1]+=q[i].s;
    rep(i,0,N-1)printf("%d\n",ans[i]);
}