acwing2847. 老C的任务（cdq分治求三维偏序）

思路：求一个矩阵内的点数可以用二维前缀和求出，那么二维前缀和就是求左下方的点的数量，也就是存在偏序关系xi<xj,yi<yj,那么直接上cdq分治求偏序关系。

const int N = 6e5 + 100;
struct node {
	int x, y, z;
	ll p;
	int id, fg;
	ll sum;
	bool operator<(const node& b)const {
		if (x != b.x)return x < b.x;
		if (y != b.y)return y < b.y;
		return z < b.z;
	}
}e[N], w[N];
ll res[N];
void merge_sort(int l, int r) {
	if (l >= r)return;
	int mid = l + r >> 1;
	merge_sort(l, mid);
	merge_sort(mid + 1, r);
	int i = l, j = mid + 1, k = 0;
	ll sum = 0;
	//归并排序确定第一维
	//分L,R区间，利用单调性维护第二维
	while (i <= mid && j <= r) {
		if (e[i].y <= e[j].y) {//维护第三维的信息
			if (e[i].z == 1)sum += e[i].p;
			w[++k] = e[i++];
		}//前两维都已经偏序了，那么直接求出这个状态对右区间某个端点的答案数量
		else {
			e[j].sum += sum;
			w[++k] = e[j++];
		}
	}
	while (i <= mid) {
		if (e[i].z == 1)sum += e[i].p;
		w[++k] = e[i++];
	}
	while (j <= r) {
		e[j].sum += sum;
		w[++k] = e[j++];
	}
	for (int i = l, j = 1;j <= k;i++, j++)e[i] = w[j];
}
int main()
{
#ifndef ONLINE_JUDGE 
	freopen("in.txt", "r", stdin);
#endif
	int n, m, k = 0;
	cin >> n >> m;
	f(i, 1, n) {
		int x = in(), y = in(), p = in();
		e[++k] = node{ x,y,1,p,0,0 };
	}
	f(i, 1, m) {
		int x1 = in(), y1 = in(), x2 = in(), y2 = in();
		e[++k] = node{ x1 - 1,y1 - 1,2,0,i,1 };
		e[++k] = node{ x1 - 1,y2,2,0,i,-1 };
		e[++k] = node{ x2,y1 - 1,2,0,i,-1 };
		e[++k] = node{ x2,y2,2,0,i,1 };
	}
	sort(e + 1, e + 1 + k);
	merge_sort(1, k);
	f(i, 1, k) {
		if (e[i].z == 2)res[e[i].id] += e[i].sum*e[i].fg;
	}
	f(i, 1, m)printf("%lld\n", res[i]);
	return 0;
}