[BZOJ 3262] 陌上花开 分治

#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <cctype>
#include <algorithm>
using namespace std;

#define F(i, a, b) for (register int i = (a); i <= (b); i++)

const int N = 100005;
const int K = 200005;

int n, k;
struct Data {
    int s, c, m, id;
    inline Data(int _s = 0, int _c = 0, int _m = 0, int _id = 0): s(_s), c(_c), m(_m), id(_id) {}
    friend inline bool operator < (Data A, Data B) {
        return A.s != B.s ? A.s < B.s : A.c != B.c ? A.c < B.c : A.m < B.m;
    }
    friend inline bool operator == (Data A, Data B) {
        return A.s == B.s && A.c == B.c && A.m == B.m;
    }
}dat[N];

int tr[K];
int lev[N], cnt[N];

namespace Input {
    const int S = 2000000;
    char s[S], *h = s+S, *t = h;
    inline char getchr(void) { if (h == t) fread(s, 1, S, stdin), h = s; return *h++; }
    inline int rd(void) {
        int f = 1; char c = getchr(); for (; !isdigit(c); c = getchr()) if (c == ‘-‘) f = -1;
        int x = 0; for (; isdigit(c); c = getchr()) x = x*10+c-‘0‘; return x*f;
    }
}
using Input::rd;

inline int lowbit(int i) { return i & -i; }
inline void Add(int x, int w) { for (int i = x; i <= k; i += lowbit(i)) tr[i] += w; }
inline int Sum(int x) { int s = 0; for (int i = x; i > 0; i -= lowbit(i)) s += tr[i]; return s; }

void Solve(int L, int R) {
    if (L == R) return;
    
    int M = (L+R)>>1;
    Solve(L, M);
    Solve(M+1, R);
    
    for (int cL = L-1, cR = M+1; cR <= R; cR++) {
        while (cL+1 <= M && dat[cR].c >= dat[cL+1].c)
            Add(dat[++cL].m, 1);
        lev[dat[cR].id] += Sum(dat[cR].m);
    }
    F(cL, L, M)
        if (dat[R].c >= dat[cL].c)
            Add(dat[cL].m, -1);
        else break;
    
    static Data tmp[N];
    for (int tot = L, cL = L, cR = M+1; tot <= R; tot++)
        if (cR > R || (cL <= M && dat[cL].c <= dat[cR].c))
            tmp[tot] = dat[cL++];
        else tmp[tot] = dat[cR++];
    F(i, L, R) dat[i] = tmp[i];
}

int main(void) {
    #ifndef ONLINE_JUDGE
        freopen("xsy3262.in", "r", stdin);
        freopen("xsy3262.out", "w", stdout);
    #endif
    
    n = rd(), k = rd();
    F(i, 1, n) {
        int s = rd(), c = rd(), m = rd();
        dat[i] = Data(s, c, m, i);
    }
    
    sort(dat+1, dat+n+1);
    for (int l = 1, r; l <= n; l = r+1) {
        for (r = l-1; r+1 <= n && dat[r+1] == dat[l]; r++);
        for (int i = l, cnt = r-l; i <= r; i++, cnt--)
            lev[dat[i].id] += cnt;
    }
    Solve(1, n);
    F(i, 1, n) cnt[lev[i]]++;
    for (int i = 0; i < n; i++) printf("%d\n", cnt[i]);
    
    return 0;
}