[Luogu3810] 【模板】三维偏序（陌上花开） [偏序][cdq分治/bitset/k-d tree]

[$\mathfrak{L}\mathfrak{i}\mathfrak{n}\mathfrak{k}$]

---

补充一个：数据保证 $a_i,b_i,c_i\in {\mathbb{N}}^{\ast }$

---

//一维排序二维cdq三维bittree
#include<cstdio>
#include<ctime>
#include<cmath>
#include<iostream>
#include<algorithm>
using namespace std;
const int MAXN = 200005;
struct ori
{
    int a, b, c;
    ori(int x = 0, int y = 0, int z = 0)
    {
        a = x;
        b = y;
        c = z;
    }
    bool operator < (const ori& o) const
    {
    	if (a==o.a)
    	{
    		if (b==o.b)
    		{
    			return c<o.c;
    		}
    		return b<o.b;
    	}
    	return a<o.a;
    }
    bool operator == (const ori& o) const
    {
        return a==o.a&&b==o.b&&c==o.c;
    }
}ele[MAXN];
int n, m, k;
struct node
{
    int a, b, c, sz, ans;
    node(int u = 0, int v = 0, int w = 0, int x = 0, int y = 0)
    {
        a = u, b = v, c = w, sz = x, ans = y;
    }
}o[MAXN], e[MAXN];
int p, q, tot, ans[MAXN];
int bit[MAXN];
void Add(int x, int val)
{
    while (x <= k)
    {
        bit[x] += val;
        x += x & -x;
    }
}
int Query(int x)
{
    int ret = 0;
    while (x)
    {
        ret += bit[x];
        x -= x & -x;
    }
    return ret;
}
void cdq(int L, int R)
{
    if (L >= R) return;
    int Mid = L + R >> 1;
    
    cdq(L, Mid);
    cdq(Mid + 1, R);
    
    p = L, q = Mid + 1, tot = L;
    while (p <= Mid && q <= R)
    {
        if (o[p].b <= o[q].b)
        {
            Add(o[p].c, o[p].sz);
            e[tot++] = o[p++];
        }
        else
        {
            o[q].ans += Query(o[q].c);
            e[tot++] = o[q++];
        }
    }
    while (q <= R)
    {
        o[q].ans += Query(o[q].c);
        e[tot++] = o[q++];
    }
    for (int i = L; i < p; ++i) Add(o[i].c, -o[i].sz);
    while (p <= Mid) e[tot++] = o[p++];
    for (int i = L; i <= R; ++i) o[i] = e[i];
}
int main()
{
    scanf("%d%d", &n, &k);
    for (int aa, bb, cc, i = 1; i <= n; ++i)
    {
        scanf("%d%d%d", &aa, &bb, &cc);
        ele[i] = ori(aa, bb, cc);
    }
    sort(ele+1, ele+1+n);
    for (int i = 1; i <= n; ++i)
    {
        if (ele[i] == ele[i-1] && i > 1)
        {
            ++o[m].sz;
            continue;
        }
        o[++m] = node(ele[i].a, ele[i].b, ele[i].c, 1);
    }
    cdq(1, m);
    for (int i = 1; i <= m; ++i) ans[o[i].ans+o[i].sz-1] += o[i].sz;
    for (int i = 0; i < n; ++i) printf("%d\n", ans[i]);
    return 0;
}

---

//一维排序bitset
你好，它跑不过陌上花开
但是高维偏序一般做法就是利用各种bitset暴力乱搞。
而且还可以方便地干掉强制在线（如果没有被卡的话）。

---

//一维排序树套树
写nmd 不写，告辞
一维排序

---

//一维排序k-d tree
啊啊啊啊啊啊啊啊啊啊啊啊啊啊啊啊啊啊啊啊啊啊啊啊啊啊啊啊啊啊啊啊啊啊啊啊啊啊啊啊啊啊啊啊啊啊啊啊啊啊啊啊啊啊啊啊啊啊啊啊啊啊啊啊a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'a'aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaoaaaiau
咕咕咕
O(n\sqrt{n})