【P3810 【模板】三维偏序（陌上花开）】CDQ分治

P3810
一维偏序用排序
二维排序用 排序 + CDQ分治
三维排序用 排序 + CDQ分治 + 树状数组

CDQ分治核心思想就是我能解决 l 到 mid 就解决
能解决 mid+1 到 r 就解决
其中再算一个 l - mid 中的修改对 mid + 1 到 r 的查询的影响

/*
    if you can't see the repay
    Why not just work step by step
    rubbish is relaxed
    to ljq
*/
#include <cstdio>
#include <cstring>
#include <iostream>
#include <queue>
#include <cmath>
#include <map>
#include <stack>
#include <set>
#include <sstream>
#include <vector>
#include <stdlib.h>
#include <algorithm>
//#pragma comment(linker, "/STACK:10240000,10240000")
using namespace std;

#define dbg(x) cout<<#x<<" = "<< (x)<< endl
#define dbg2(x1,x2) cout<<#x1<<" = "<<x1<<" "<<#x2<<" = "<<x2<<endl
#define dbg3(x1,x2,x3) cout<<#x1<<" = "<<x1<<" "<<#x2<<" = "<<x2<<" "<<#x3<<" = "<<x3<<endl
#define max3(a,b,c) max(a,max(b,c))
#define min3(a,b,c) min(a,min(b,c))

typedef pair<int,int> pll;
typedef long long ll;
typedef unsigned long long ull;
const ull hash1 = 201326611;
const int inf = 0x3f3f3f3f;
const int _inf = 0xc0c0c0c0;
const ll INF = 0x3f3f3f3f3f3f3f3f;
const ll _INF = 0xc0c0c0c0c0c0c0c0;
const ll mod =  (int)1e9+7;

ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}
ll ksm(ll a,ll b,ll mod){int ans=1;while(b){if(b&1) ans=(ans*a)%mod;a=(a*a)%mod;b>>=1;}return ans;}
ll inv2(ll a,ll mod){return ksm(a,mod-2,mod);}
void exgcd(ll a,ll b,ll &x,ll &y,ll &d){if(!b) {d = a;x = 1;y=0;}else{exgcd(b,a%b,y,x,d);y-=x*(a/b);}}//printf("%lld*a + %lld*b = %lld\n", x, y, d);
//ull ha[MAX_N],pp[MAX_N];

inline int read()
{
    int date = 0,m = 1; char ch = 0;
    while(ch!='-'&&(ch<'0'|ch>'9'))ch = getchar();
    if(ch=='-'){m = -1; ch = getchar();}
    while(ch>='0' && ch<='9')
    {
        date = date*10+ch-'0';
        ch = getchar();
    }return date*m;
}
const int MAX_N =  100025;
int k,dfn,C[MAX_N<<2],tim[MAX_N<<2],out[MAX_N],ans[MAX_N];
struct node
{
    int a,b,c;
    bool operator < (const node other) const
    {
        return a < other.a||(a==other.a&&(b<other.b||b==other.b&&c<other.c));
    }
}arr_[MAX_N];
struct query
{
    int a,b,c,id,num;
}arr[MAX_N],brr[MAX_N];
void add(int x,int y)
{
    for(;x<=k;x+=x&(-x))
    {
        if(tim[x]!=dfn) tim[x] = dfn,C[x] = 0;
        C[x]+=y;
    }
}
ll get(int x)
{
    ll res = 0;
    for(;x;x-=x&(-x))
    {
        if(tim[x]==dfn) res+=C[x];
    }
    return res;
}
bool same(int a,int b)
{
    if(arr_[a].a^arr_[b].a||arr_[a].b^arr_[b].b||arr_[a].c^arr_[b].c) return false;
    return true;
}
void cdq(int l,int r)
{
    if(l==r) return;
    int mid = (l+r)>>1;
    cdq(l,mid);cdq(mid+1,r);
    dfn++;
    int t1 = l,t2 = mid + 1;
    for(int i = l;i<=r;++i)
    {
        if((t1<=mid&&arr[t1].b<=arr[t2].b)||t2>r)
        {
            add(arr[t1].c,arr[t1].num);
            brr[i] = arr[t1++];
        }
        else
        {
            ans[arr[t2].id] += get(arr[t2].c);
            brr[i] = arr[t2++];
        }
    }
    for(int i = l;i<=r;++i) arr[i] = brr[i];
}
/*namespace sgt
{
    #define mid ((l+r)>>1)

    #undef mid
}*/

/*int root[MAX_N],cnt,sz;
namespace hjt
{
    #define mid ((l+r)>>1)
    struct node{int l,r,maxx;}T[MAX_N*40];

    #undef mid
}*/

int main()
{
    //ios::sync_with_stdio(false);
    //freopen("a.txt","r",stdin);
    //freopen("b.txt","w",stdout);
    int n,tot = 0;
    scanf("%d%d",&n,&k);
    for(int i = 1;i<=n;++i)
        scanf("%d%d%d",&arr_[i].a,&arr_[i].b,&arr_[i].c);
    sort(arr_+1,arr_+1+n);
    for(int i = 1;i<=n;)
    {
        int j = i +  1;
        while(j<=n&&same(i,j)) j++;
        j--;
        arr[++tot].a = arr_[i].a;arr[tot].b = arr_[i].b;arr[tot].c = arr_[i].c;
        arr[tot].num = j-i+1;arr[tot].id = tot;
        i = j+1;
    }
    cdq(1,tot);
    for(int i = 1;i<=tot;++i) out[ans[arr[i].id]+arr[i].num-1]+=arr[i].num;
    for(int i = 0;i<n;++i) printf("%d\n",out[i]);
    //fclose(stdin);
    //fclose(stdout);
    //cout << "time: " << (long long)clock() * 1000 / CLOCKS_PER_SEC << " ms" << endl;
    return 0;
}