[题解]LuoGu3833：[SHOI2012]魔法树

原题传送门
这一阶段最后一道树剖题啦，说实话我的找题能力真的烂，做了一大堆裸题（其实也就这样了吧）。
两个操作

• 两节点间路径区间加
• 子树和

就是裸题啦，不过也要注意几点

• 爆int，开longlong
• 需要pushdown，区间加时需要乘上区间长度

另：突然发现，此题也可以用树状数组做，因为只统计子树和，这样的话只需要一个dfs序就完事了
常数比线段树小哦
然后这题好像不会树剖也可以做，直接倍增lca？貌似可行，不过我懒得打了//

Code：

#include <bits/stdc++.h>
#define maxn 100010
#define ls rt << 1
#define rs rt << 1 | 1
#define int long long
using namespace std;
struct Edge{
	int to, next;
}edge[maxn << 1];
struct Seg{
	int l, r, sum, tag;
}seg[maxn << 2];
int head[maxn], num, d[maxn], fa[maxn], size[maxn], son[maxn], id[maxn], cnt, top[maxn], n;

inline int read(){
	int s = 0, w = 1;
	char c = getchar();
	for (; !isdigit(c); c = getchar()) if (c == '-') w = -1;
	for (; isdigit(c); c = getchar()) s = (s << 1) + (s << 3) + (c ^ 48);
	return s * w;
}

void add_edge(int x, int y){ edge[++num].to = y; edge[num].next = head[x]; head[x] = num; }

void dfs(int u){
	size[u] = 1, son[u] = -1;
	for (int i = head[u]; i; i = edge[i].next){
		int v = edge[i].to;
		if (v != fa[u]){
			fa[v] = u, d[v] = d[u] + 1;
			dfs(v);
			size[u] += size[v];
			if (son[u] == -1 || son[u] != -1 && size[son[u]] < size[v]) son[u] = v;
		}
	}
}

void dfs(int u, int x){
	id[u] = ++cnt, top[u] = x;
	if (son[u] == -1) return;
	dfs(son[u], x);
	for (int i = head[u]; i; i = edge[i].next){
		int v = edge[i].to;
		if (v != fa[u] && v != son[u]) dfs(v, v);
	}
}

void pushup(int rt){ seg[rt].sum = seg[ls].sum + seg[rs].sum; }

void pushdown(int rt){
	seg[ls].sum += (seg[ls].r - seg[ls].l + 1) * seg[rt].tag, seg[rs].sum += (seg[rs].r - seg[rs].l + 1) * seg[rt].tag;
	seg[ls].tag += seg[rt].tag, seg[rs].tag += seg[rt].tag;
	seg[rt].tag = 0;
}

void build(int rt, int l, int r){
	seg[rt].l = l, seg[rt].r = r;
	if (l == r) return;
	int mid = (l + r) >> 1;
	build(ls, l, mid); build(rs, mid + 1, r);
}

void update(int rt, int l, int r, int delta){
	if (seg[rt].l > r || seg[rt].r < l) return;
	if (seg[rt].l >= l && seg[rt].r <= r){
		seg[rt].sum += (seg[rt].r - seg[rt].l + 1) * delta;
		seg[rt].tag += delta;
		return;
	}
	if (seg[rt].tag) pushdown(rt);
	update(ls, l, r, delta); update(rs, l, r, delta);
	pushup(rt);
}

int query(int rt, int l, int r){
	if (seg[rt].l > r || seg[rt].r < l) return 0;
	if (seg[rt].l >= l && seg[rt].r <= r) return seg[rt].sum;
	if (seg[rt].tag) pushdown(rt);
	return query(ls, l, r) + query(rs, l, r);
}

signed main(){
	n = read();
	for (int i = 1; i < n; ++i){
		int x = read(), y = read(); ++x, ++y;
		add_edge(x, y); add_edge(y, x);
	}
	dfs(1); dfs(1, 1); build(1, 1, n);
	int m = read();
	while (m--){
		char c = getchar(); for (; c != 'A' && c != 'Q'; c = getchar());
		if (c == 'A'){
			int x = read(), y = read(), z = read(); ++x, ++y;
			while (top[x] != top[y]){
				if (d[top[x]] < d[top[y]]) swap(x, y);
				update(1, id[top[x]], id[x], z);
				x = fa[top[x]];
			}
			if (d[x] < d[y]) swap(x, y);
			update(1, id[y], id[x], z);
		} else{
			int x = read(); ++x;
			printf("%lld\n", query(1, id[x], id[x] + size[x] - 1));
		}
	}
	return 0;
}