洛谷P3810 三维偏序(二维线段树)

洛谷P3810 三维偏序(二维线段树)

title

Code

#include <cstdio>
#include <algorithm>

using namespace std;

const int N = 28900010, M = 100010;

struct Data {
	int x, y, z;
} ;



struct Segment {
	int s[N], rt[N], ch[N][2], tot, n, m;

	void clear(int n, int m, int k, int x) {
		tot = 0;
		this->n = n;
		this->m = m;
		for (int i = 0; i <= k; ++i) {
			s[i] = x;
			rt[i] = ch[i][0] = ch[i][1] = 0;
		}
		return ;
	}

	int query2(int k, int l, int r, int x, int y) {
		if (!k)
			return 0;
		if (x <= l && r <= y)
			return s[k];
		int mid = (l + r) >> 1, res = 0;
		if (x <= mid)
			res += query2(ch[k][0], l, mid, x, y);
		if (y > mid)
			res += query2(ch[k][1], mid + 1, r, x, y);
		return res;
	}

	void modify2(int &k, int l, int r, int x, int v) {
		if (!k)
			k = ++tot;
		s[k] += v;
		if (l == r)
			return;
		int mid = (l + r) >> 1;
		if (x <= mid)
			modify2(ch[k][0], l, mid, x, v);
		else
			modify2(ch[k][1], mid + 1, r, x, v);
	}

	int query1(int k, int l, int r, int xl, int xr, int yl, int yr) {
		if (!k)
			return 0;
		if (xl <= l && r <= xr)
			return query2(rt[k], 1, m, yl, yr);
		int mid = (l + r) >> 1, res = 0;
		if (xl <= mid)
			res += query1(ch[k][0], l, mid, xl, xr, yl, yr);
		if (xr > mid)
			res += query1(ch[k][1], mid + 1, r, xl, xr, yl, yr);
		return res;
	}

	void modify1(int &k, int l, int r, int x, int y, int v) {
		if (!k)
			k = ++tot;
		modify2(rt[k], 1, m, y, v);
		if (l == r)
			return ;
		int mid = (l + r) >> 1;
		
		if (x <= mid)
			modify1(ch[k][0], l, mid, x, y, v);
		else
			modify1(ch[k][1], mid + 1, r, x, y, v);

		return ;
	}


	int modify(int x, int y, int v) {
		int k = 1;
		modify1(k, 1, n, x, y, v);
		return k;
	}

	int query(int xl, int xr, int yl, int yr) {
		return query1(1, 1, n, xl, xr, yl, yr);
	}
} ;

Segment tr;

Data s[M], t[M];

int ans[M], cnt[M];

bool cmp(Data x, Data y) {
	if (x.z != y.z)
		return x.z < y.z;
	if (x.x != y.x)
		return x.x < y.x;
	return x.y < y.y;
}

int main() {
	int n, m, k;
	scanf("%d %d", &n, &k);
	for (int i = 1; i <= n; ++i)
		scanf("%d %d %d", &t[i].x, &t[i].y, &t[i].z);
	sort(t + 1, t + 1 + n, cmp);
	s[m = 1] = t[1];
	cnt[1] = 1;

	tr.clear(k, k, 144 * k, 0);
	for (int i = 2; i <= n; ++i) {
		if (t[i].x != s[m].x || t[i].y != s[m].y || t[i].z != s[m].z) s[++m] = t[i], cnt[m] = 1;
		else ++cnt[m];
	}

	for (int i = 1; i <= m; ++i) {
		ans[tr.query(1, s[i].x, 1, s[i].y) + cnt[i] - 1] += cnt[i];
		tr.modify(s[i].x, s[i].y, cnt[i]);
	}

	for (int i = 0; i < n; ++i)
		printf("%d\n", ans[i]);

	return 0;
}