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

传送门：https://www.luogu.org/problemnew/show/P3810

cdq分治的模板题，第一层外部排序，第二层cdq归并排序，这个时候不用考虑第一次的顺序，第三次用树状数组。

注意，不要用memset，用队列保存加上的值，最后在把加上的值减去就行了。

#include <algorithm>
#include  <iterator>
#include  <iostream>
#include   <cstring>
#include   <cstdlib>
#include   <iomanip>
#include    <bitset>
#include    <cctype>
#include    <cstdio>
#include    <string>
#include    <vector>
#include     <stack>
#include     <cmath>
#include     <queue>
#include      <list>
#include       <map>
#include       <set>
#include   <cassert>
//#include <unordered_map>
/*

⊂_ヽ
　 ＼＼ Λ＿Λ  来了老弟
　　 ＼('ㅅ')
　　　 >　⌒ヽ
　　　/ 　 へ＼
　　 /　　/　＼＼
　　 ﾚ　ノ　　 ヽ_つ
　　/　/
　 /　/|
　(　(ヽ
　|　|、＼
　| 丿 ＼ ⌒)
　| |　　) /
'ノ )　　Lﾉ

*/

using namespace std;
#define lson (l , mid , rt << 1)
#define rson (mid + 1 , r , rt << 1 | 1)
#define debug(x) cerr << #x << " = " << x << "\n";
#define pb push_back
#define pq priority_queue

typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
//typedef __int128 bll;
typedef pair<ll ,ll > pll;
typedef pair<int ,int > pii;
typedef pair<int,pii> p3;

//priority_queue<int> q;//这是一个大根堆q
//priority_queue<int,vector<int>,greater<int> >q;//这是一个小根堆q
#define fi first
#define se second
//#define endl '\n'

#define boost ios::sync_with_stdio(false);cin.tie(0)
#define rep(a, b, c) for(int a = (b); a <= (c); ++ a)
#define max3(a,b,c) max(max(a,b), c);
#define min3(a,b,c) min(min(a,b), c);

const ll oo = 1ll<<;
const ll mos = 0x7FFFFFFF;  //
const ll nmos = 0x80000000;  //-2147483648
const int inf = 0x3f3f3f3f;
const ll inff = 0x3f3f3f3f3f3f3f3f; //
const int mod = ;
const double esp = 1e-;
const double PI=acos(-1.0);
const double PHI=0.61803399;    //黄金分割点
const double tPHI=0.38196601;

template<typename T>
inline T read(T&x){
    x=;int f=;char ch=getchar();
    while (ch<''||ch>'') f|=(ch=='-'),ch=getchar();
    while (ch>=''&&ch<='') x=x*+ch-'',ch=getchar();
    return x=f?-x:x;
}

inline void cmax(int &x,int y){if(x<y)x=y;}
inline void cmax(ll &x,ll y){if(x<y)x=y;}
inline void cmin(int &x,int y){if(x>y)x=y;}
inline void cmin(ll &x,ll y){if(x>y)x=y;}
#define MODmul(a, b) ((a*b >= mod) ? ((a*b)%mod + 2*mod) : (a*b))
#define MODadd(a, b) ((a+b >= mod) ? ((a+b)%mod + 2*mod) : (a+b))

/*-----------------------showtime----------------------*/
            const int maxn = 1e5+;
            struct node{
                int x,y,z;
                int id;
            }a[maxn],b[maxn],tmp[maxn];
            bool cmp(node a,node b){
                if(a.x != b.x) return a.x < b.x;
                if(a.y != b.y) return a.y < b.y;
                else return a.z < b.z;
            }
            int cnt[maxn],ans[maxn];

            int sum[maxn*];
            int lowbit(int x){
                return x & (-x);
            }
            void add(int x,int c){
                while(x < maxn*){
                    sum[x] += c;
                    x += lowbit(x);
                }
            }
            int getsum(int x){
                int res = ;
                while(x > ) {
                    res += sum[x];
                    x -= lowbit(x);
                }
                return res;
            }
            int lazy[maxn];
            queue<int>que;
            void cdq(int le,int ri){
                int mid = (le + ri) >> ;
                if(ri - le <= ) return ;
                cdq(le, mid);   cdq(mid+, ri);

         //       memset(sum, 0, sizeof(sum));

                int p = le, q = mid+;
                int id = ;
                while(p <= mid && q <= ri){
                    if(a[p].y <= a[q].y) {
                        add(a[p].z, lazy[a[p].id]);
                        que.push(p);
                        tmp[++id] = a[p++];
                    }
                    else {
                        cnt[a[q].id] += getsum(a[q].z);
                        tmp[++id] = a[q++];
                    }
                }
                while(p <= mid) tmp[++id] = a[p++];
                while(q <= ri) {
                    cnt[a[q].id] += getsum(a[q].z);
                    tmp[++id] = a[q++];
                }
                while(!que.empty()){
                    int u = que.front(); que.pop();
                    add(a[u].z, -lazy[a[u].id]);
                }

                for(int i=; i<=id; i++) a[i+le-] = tmp[i];

            }
           // int out[maxn];
           map<p3,int>mp;

int main(){
            int n,k;
            scanf("%d%d", &n, &k);
            int tot = ;
            rep(i, , n) {
                int x, y, z;
                scanf("%d%d%d", &x, &y, &z);
             //   read(x);read(y);read(z);
                p3 tp = p3(x, pii(y, z));
                if(mp.count(tp)) lazy[mp[tp]]++,cnt[mp[tp]]++;
                else {
                    tot++;
                    a[tot].id = tot;
                    a[tot].x = x;
                    a[tot].y = y;
                    a[tot].z = z;
                    mp[tp] = tot;
                    lazy[tot] = ;
                }
            }
            sort(a+, a++tot, cmp);

            cdq(, tot);

            rep(i, , tot) ans[cnt[a[i].id]] += lazy[a[i].id];
            /*
            rep(i, 1, n) {
                out[a[i].id] = cnt[a[i].id];
            }
            rep(i, 1, n)
                cout<<cnt[i]<<" ";
            cout<<endl;
            */
            rep(i, , n-) printf("%d\n", ans[i]);
            return ;
}