cdq分治

 

 

 

 

 

 

#include<bits/stdc++.h>
using namespace std;
const int N=1e5+11,M=5e5+11;
int n,m,S,c[M],pri[N];
inline int re_ad() {
    char ch=getchar(); int x=0,f=1;
    while(ch<'0' || ch>'9') { if(ch=='-') f=-1; ch=getchar(); }
    while('0'<=ch && ch<='9') x=(x<<1)+(x<<3)+ch-'0',ch=getchar();
    return x*f;
}
struct Node {
    int x,y,z,cnt,ans;
    bool operator == (const Node &B) const { return (x==B.x) && (y==B.y) && (z==B.z); }
    bool operator < (const Node &B) const { if(x!=B.x) return x<B.x; else return y!=B.y?y<B.y:z<B.z; }
}a[N],t[N];
inline bool cmp(Node A,Node B) { return A.y!=B.y?A.y<B.y:A.z<B.z; }

inline int lowbit(int d) { return d&(-d); }
inline void Insert(int d,int x) { for(;d<=S;d+=lowbit(d)) c[d]+=x; }
inline int Query(int d) { int res=0; for(;d;d-=lowbit(d)) res+=c[d]; return res; }

void CdqSolve(int l,int r) {
    if(l==r) return;
    int mid=(l+r)>>1,i=l,j=mid+1;
    CdqSolve(l,mid),CdqSolve(mid+1,r);
    sort(a+l,a+mid+1,cmp),sort(a+mid+1,a+r+1,cmp);
    for(;j<=r;++j) {
        for(;i<=mid && a[i].y<=a[j].y;++i) Insert(a[i].z,a[i].cnt);
        a[j].ans+=Query(a[j].z);
    }
    for(int j=l;j<i;++j) Insert(a[j].z,-a[j].cnt);
}

int main()
{
    m=re_ad(),S=re_ad();
    for(int i=1;i<=m;++i) t[i].x=re_ad(),t[i].y=re_ad(),t[i].z=re_ad();
    sort(t+1,t+m+1);
    for(int i=1;i<=m;++i) {
        if(t[i]==t[i-1]) ++a[n].cnt;
        else a[++n]=t[i],a[n].cnt=1;
    }
    CdqSolve(1,n);
    for(int i=1;i<=n;++i) pri[a[i].ans+a[i].cnt-1]+=a[i].cnt;
    for(int i=0;i<m;++i) printf("%d\n",pri[i]); puts("");
//    for(int i=1;i<=n;++i) printf("%d: %d %d %d %d %d\n",i,a[i].x,a[i].y,a[i].z,a[i].cnt,a[i].ans);
    return 0;
}