CodeForces - 669E Little Artem and Time Machine 动态主席树 / CDQ分治

题目链接：https://vjudge.net/problem/CodeForces-669E

题意：1 x y  在第x秒y点的值+1.、2 x y  在第x秒y点的值-1 、 3 x y  查询在x秒y点处的值

题解：

动态主席树：但要注意内存的限制

#include <bits/stdc++.h>
using namespace std;
const int N = 100010;
#define lowbit(x) (x & (-x))

struct node1 {
	int op;
	int x, y;
}q[N];
struct node2 {
	int l, r;
	int val;
}tree[N * 172];
int n;
int tot;
int rot[N];
int a[N], b[N], len1, len2;
int update1(int pre, int l, int r, int pos, int val) {
	int cur = ++tot;
	tree[cur] = tree[pre];
	tree[cur].val += val;
	if(l == r) return cur;
	int mid = (l + r) >> 1;
	if(pos <= mid) tree[cur].l = update1(tree[pre].l, l, mid, pos, val);
	else tree[cur].r = update1(tree[pre].r, mid + 1, r, pos, val);
	return cur;
}
void update2(int pos, int x, int val) {
	while(pos <= len1) {
		rot[pos] = update1(rot[pos], 1, len2, x, val);
		pos += lowbit(pos);
	}
}
int query2(int cur, int pos, int l, int r) {
	if(l == r) return tree[cur].val;
	int mid = (l + r) >> 1;
	if(pos <= mid) return query2(tree[cur].l, pos, l, mid);
	else query2(tree[cur].r, pos, mid + 1, r);
}
int query1(int pos, int x) {
	int res = 0;
	for(int i = pos; i >= 1; i -= lowbit(i))
		res += query2(rot[i], x, 1, len2);
	return res;
}
int main() {
	int T;
	int tmpt, tmpx;
	scanf("%d", &n);
	tot = 0;
	for(int i = 1; i <= n; i++) {
		scanf("%d %d %d", &q[i].op, &q[i].x, &q[i].y);
		a[i] = q[i].x;
		b[i] = q[i].y;
	}
	sort(a + 1, a + 1 + n); sort(b + 1, b + 1 + n);
	len1 = unique(a + 1, a + 1 + n) - (a + 1);
	len2 = unique(b + 1, b + 1 + n) - (b + 1);
	for(int i = 1; i <= n; i++) {
		tmpt = lower_bound(a + 1, a + 1 + len1, q[i].x) - a;
		tmpx = lower_bound(b + 1, b + 1 + len2, q[i].y) - b;
		if(q[i].op == 1) {
			update2(tmpt, tmpx, 1);
		} else if(q[i].op == 2) {
			update2(tmpt, tmpx, -1);
		} else {
			printf("%d\n", query1(tmpt, tmpx));
		}
	}
	
	return 0;
}

CDQ分治：三维偏序，按照操作循序分治，每次按照x的大小操作，查询对应的y即可

#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 10;
struct node {
	int id;
	int op, x, y;
}q[N];
int n;
int num[N];
int b[N], len;
int ans[N];
bool cmp1(const node &x, const node &y) {
	return x.x < y.x;
}
bool cmp2(const node &x, const node &y) {
	return x.id < y.id;
}
void dfs(int l, int r) {
	if(l >= r) return;
	int mid = (r + l) >> 1;
	dfs(l, mid); dfs(mid + 1, r);
	memset(num, 0, sizeof(num));
	sort(q + l, q + mid + 1, cmp1);
	sort(q + mid + 1, q + r + 1, cmp1);
	for(int i = l, j = mid + 1; j <= r; j++) {
		while(i <= mid && q[i].x <= q[j].x)
			num[q[i].y] += q[i].op, i++;
		if(q[j].op == 0)
			ans[q[j].id] += num[q[j].y]; 
	}
}
 
int main() {
	scanf("%d", &n);
	for(int i = 1; i <= n; i++) {
		scanf("%d %d %d", &q[i].op, &q[i].x, &q[i].y);
		if(q[i].op == 2) q[i].op = -1;
		if(q[i].op == 3) q[i].op = 0;
		q[i].id = i;
		b[i] = q[i].y;
	}
	sort(b + 1, b + 1 + n);
	len = unique(b + 1, b + 1 + n) - (b + 1);
	for(int i = 1; i <= n; i++) {
		q[i].y = lower_bound(b + 1, b + 1 + len, q[i].y) - b;
	}
	dfs(1, n);
	sort(q + 1, q + 1 + n, cmp2);
	for(int i = 1; i <= n; i++)
		if(q[i].op == 0) printf("%d\n", ans[i]);
	return 0;
}