【ybt金牌导航5-1-4】【luogu P3313】旅行留宿 / 旅行

旅行留宿 / 旅行

题目链接：ybt金牌导航5-1-4 / luogu P3313

题目大意

有一个树，树上节点有属性和权值。
要你支持一些操作，把某个点的属性或权值改变，询问一条树中路径中属性为某个值的点的权值和或最大权值。

思路

看到树上路径，想到树链剖分。
然后看到要统一统一属性的，想到每个线段树点里面再套个线段树记录位置的。
（后来发现按这么搞其实数组都可以）

然后你就发现空间是炸裂的。（我打完 200 行才发现/kk）
然后你想到你外层的线段树其实很多地方对不到全部的属性，但你又开了空间。
那你考虑把属性放到外面，即每个属性都弄一个线段树。
然后容易看出肯定是要动态开点，然后操作就很容易的想出来了。
（不知道的可以看看代码，很好理解的）

代码

#include<cstdio>
#include<algorithm>

using namespace std;

struct node {
	int to, nxt;
}e[200001];
struct Tree {
	int maxn, sum, l, r;
}t[10000001];
int fa[100001], sz[100001], son[100001], deg[100001];
int pl[100001], dfn[100001], top[100001], tmp;
int n, Q, c[100001], val[100001], rt[100001];
int x, y, le[100001], KK, tot;
char op, opp;

void add(int x, int y) {
	e[++KK] = (node){y, le[x]}; le[x] = KK;
	e[++KK] = (node){x, le[y]}; le[y] = KK;
}

//树链剖分
void dfs1(int now, int father) {
	fa[now] = father;
	deg[now] = deg[father] + 1;
	sz[now] = 1;
	int maxn = 0;
	for (int i = le[now]; i; i = e[i].nxt)
		if (e[i].to != father) {
			dfs1(e[i].to, now);
			sz[now] += sz[e[i].to];
			if (sz[e[i].to] > maxn) {
				maxn = sz[e[i].to];
				son[now] = e[i].to;
			} 
		}
}

void dfs2(int now, int father) {
	if (son[now]) {
		pl[son[now]] = ++tmp;
		top[son[now]] = top[now];
		dfn[tmp] = son[now];
		dfs2(son[now], now);
	}
	
	for (int i = le[now]; i; i = e[i].nxt)
		if (e[i].to != father && e[i].to != son[now]) {
			pl[e[i].to] = ++tmp;
			top[e[i].to] = e[i].to;
			dfn[tmp] = e[i].to;
			dfs2(e[i].to, now);
		}
}

//动态开点线段树
void up(int now) {
	t[now].maxn = max(t[t[now].l].maxn, t[t[now].r].maxn);
	t[now].sum = t[t[now].l].sum + t[t[now].r].sum;
}

void change(int &now, int l, int r, int pla, int num) {
	if (!now) now = ++tot;
	if (l == r) {
		t[now].maxn = num;
		t[now].sum = num;
		return ;
	}
	
	int mid = (l + r) >> 1;
	if (pla <= mid) change(t[now].l, l, mid, pla, num);
		else change(t[now].r, mid + 1, r, pla, num);
	
	up(now);
}

int query_sum(int now, int l, int r, int L, int R) {
	if (L <= l && r <= R) return t[now].sum;
	
	int mid = (l + r) >> 1, re = 0;
	if (L <= mid) re += query_sum(t[now].l, l, mid, L, R);
	if (mid < R) re += query_sum(t[now].r, mid + 1, r, L, R);
	
	return re;
}

int query_maxn(int now, int l, int r, int L, int R) {
	if (L <= l && r <= R) return t[now].maxn;
	
	int mid = (l + r) >> 1, re = 0;
	if (L <= mid) re = max(re, query_maxn(t[now].l, l, mid, L, R));
	if (mid < R) re = max(re, query_maxn(t[now].r, mid + 1, r, L, R));
	
	return re;
}

//四个操作
void change_tr(int x, int pla) {
	change(rt[c[x]], 1, n, pl[x], 0);
	change(rt[pla], 1, n, pl[x], val[x]);
	c[x] = pla;
}

void change_val(int x, int num) {
	change(rt[c[x]], 1, n, pl[x], num);
	val[x] = num;
}

int ask_sum(int x, int y, int pla) {
	int X = top[x], Y = top[y], re = 0;
	while (X != Y) {
		if (deg[X] < deg[Y]) {
			swap(x, y);
			swap(X, Y); 
		}
		re += query_sum(rt[pla], 1, n, pl[X], pl[x]);
		x = fa[X];
		X = top[x];
	}
	if (deg[x] > deg[y]) swap(x, y);
	re += query_sum(rt[pla], 1, n, pl[x], pl[y]);
	return re;
}

int ask_maxn(int x, int y, int pla) {
	int X = top[x], Y = top[y], re = 0;
	while (X != Y) {
		if (deg[X] < deg[Y]) {
			swap(x, y);
			swap(X, Y); 
		}
		re = max(re, query_maxn(rt[pla], 1, n, pl[X], pl[x]));
		x = fa[X];
		X = top[x];
	}
	if (deg[x] > deg[y]) swap(x, y);
	re = max(re, query_maxn(rt[pla], 1, n, pl[x], pl[y]));
	return re;
}

int main() {
//	printf("%.3lf", (sizeof(t)) / 1024.0 / 1024.0);
	
	scanf("%d %d", &n, &Q);
	for (int i = 1; i <= n; i++) {
		scanf("%d %d", &val[i], &c[i]);
	}
	for (int i = 1; i < n; i++) {
		scanf("%d %d", &x, &y);
		add(x, y);
	}
	
	dfs1(1, 0);
	pl[1] = ++tmp; top[1] = 1; dfn[tmp] = 1;
	dfs2(1, 0);
	
	for (int i = 1; i <= n; i++) {
		change(rt[c[i]], 1, n, pl[i], val[i]);
	}
	
	while (Q--) {
		op = getchar();
		while (op != 'Q' && op != 'C') op = getchar();
		opp = getchar();
		
		if (op == 'C' && opp == 'C') {
			scanf("%d %d", &x, &y);
			change_tr(x, y);
			continue;
		}
		if (op == 'C' && opp == 'W') {
			scanf("%d %d", &x, &y);
			change_val(x, y);
			continue;
		}
		if (op == 'Q' && opp == 'S') {
			scanf("%d %d", &x, &y);
			printf("%d\n", ask_sum(x, y, c[x]));
			continue;
		}
		if (op == 'Q' && opp == 'M') {
			scanf("%d %d", &x, &y);
			printf("%d\n", ask_maxn(x, y, c[x]));
			continue;
		}
	}
	
	return 0;
}