树链剖分+线段树--bzoj2836: 魔法树

树剖裸题···
然而太久没写树剖的我$zz$到修改用$update$直接改
简直是$mdzz$

#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cstring>
#include<cmath>
#define N 100005
#define LL long long
#define ls cur<<1
#define rs cur<<1|1
#define int LL
using namespace std;
int n,m,cnt,head[N],rt=1;
int tot,dfn[N],dep[N],son[N],siz[N],fa[N],top[N],rk[N];

inline int rd(){
	int x=0,f=1;char c=' ';
	while(c<'0' || c>'9') f=c=='-'?-1:1,c=getchar();
	while(c<='9' && c>='0') x=x*10+c-'0',c=getchar();
	return x*f;
}

struct EDGE{
	int to,nxt;
}edge[N<<1];
inline void add(int x,int y){
	edge[++cnt].to=y; edge[cnt].nxt=head[x]; head[x]=cnt;
}

void dfs1(int u,int depth,int fat){
	dep[u]=depth,fa[u]=fat; siz[u]=1;
	int maxson=-1;
	for(int i=head[u];i;i=edge[i].nxt){
		int v=edge[i].to; if(v==fat) continue;
		dfs1(v,depth+1,u); siz[u]+=siz[v];
		if(siz[v]>maxson) maxson=siz[v],son[u]=v;
	} return;
}

void dfs2(int u,int t){
	dfn[u]=++tot; rk[tot]=u; top[u]=t;
	if(!son[u]) return;
	dfs2(son[u],t);
	for(int i=head[u];i;i=edge[i].nxt){
		int v=edge[i].to;
		if(!dfn[v]) dfs2(v,v);
	} return;
}

struct Node{
	int l,r; LL sum,laz;
}node[N<<2];

void build(int cur,int L,int R){
	if(L==R){
		node[cur].l=node[cur].r=L; node[cur].sum=node[cur].laz=0;
		return;
	}
	int mid=(L+R)>>1;
	build(ls,L,mid); build(rs,mid+1,R);
	node[cur].l=node[ls].l; node[cur].r=node[rs].r;
}

inline void pushdown(int cur){
	LL x=node[cur].laz; node[cur].laz=0;
	node[ls].sum+=x*(node[ls].r-node[ls].l+1);
	node[rs].sum+=x*(node[rs].r-node[rs].l+1);
	node[ls].laz+=x, node[rs].laz+=x;
}

inline void pushup(int cur){
	node[cur].sum=node[ls].sum+node[rs].sum;
}

void update(int cur,int L,int R,int c){
	if(L<=node[cur].l && node[cur].r<=R){
		node[cur].sum+=1LL*(node[cur].r-node[cur].l+1)*c;
		node[cur].laz+=c; return; 
	}
	pushdown(cur);
	int mid=(node[cur].l+node[cur].r)>>1;
	if(L<=mid) update(ls,L,R,c);
	if(mid<R) update(rs,L,R,c);
	pushup(cur); return;
}

LL query(int cur,int L,int R){
	if(L<=node[cur].l && node[cur].r<=R) return node[cur].sum;
	pushdown(cur);
	int mid=(node[cur].l+node[cur].r)>>1; LL res=0;
	if(L<=mid) res+=query(ls,L,R);
	if(mid<R) res+=query(rs,L,R);
	return res;
}

inline void change(int x,int y,LL z){
	while(top[x]!=top[y]){
		if(dep[top[x]]<dep[top[y]]) swap(x,y);
		update(1,dfn[top[x]],dfn[x],z);
		x=fa[top[x]];
	}
	if(dep[x]>dep[y]) swap(x,y);
	update(1,dfn[x],dfn[y],z);
}

signed main(){
	n=rd();
	for(int i=1;i<n;i++){
		int x=rd(),y=rd(); x++,y++;
		add(x,y); add(y,x);
	}
	dfs1(rt,1,rt); dfs2(rt,rt);
	build(1,1,n);
	m=rd();
	while(m--){
		char s[10]; scanf("%s",s);
		if(s[0]=='A'){
			int x=rd(),y=rd(),z=rd(); x++,y++;
			change(x,y,z);
		}else{
			int x=rd(); x++;
			printf("%lld\n",query(1,dfn[x],dfn[x]+siz[x]-1));
		}
	}
	return 0;
}