[xsy2123]毛毛虫

题意：有一棵带点权的树，链修改是把$(x,y)$这条链和与其相邻的节点都加上一个数，查询是问$(x,y)$这条链和与其相邻的节点的权值和

学到了一个新姿势？

考虑树链剖分，在剖重链时每次给当前节点的儿子顺次标号，那么一条重链上所有节点的儿子的标号是连续的，也就对应着题目的限制，再补上漏掉的$lca_{x,y}$和$fa_{lca_{x,y}}$即可

#include<stdio.h>
typedef long long ll;
void swap(int&a,int&b){a^=b^=a^=b;}
int h[100010],nex[200010],to[200010],v[100010],M;
void add(int a,int b){
	M++;
	to[M]=b;
	nex[M]=h[a];
	h[a]=M;
}
int siz[100010],dep[100010],fa[100010],son[100010],n;
void dfs(int x){
	int i,k=0;
	siz[x]=1;
	dep[x]=dep[fa[x]]+1;
	for(i=h[x];i;i=nex[i]){
		if(to[i]!=fa[x]){
			fa[to[i]]=x;
			dfs(to[i]);
			siz[x]+=siz[to[i]];
			if(siz[to[i]]>siz[k])k=to[i];
		}
	}
	son[x]=k;
}
int bl[100010],p[100010],pos[100010],L[100010],R[100010];
void dfs(int x,int chain){
	int i;
	bl[x]=chain;
	L[x]=M+1;
	for(i=h[x];i;i=nex[i]){
		if(to[i]!=fa[x]){
			p[++M]=to[i];
			pos[to[i]]=M;
		}
	}
	R[x]=M;
	if(son[x])dfs(son[x],chain);
	for(i=h[x];i;i=nex[i]){
		if(to[i]!=fa[x]&&to[i]!=son[x])dfs(to[i],to[i]);
	}
}
ll s[400010],d[400010];
void pushup(int x){s[x]=s[x<<1]+s[x<<1|1];}
void build(int l,int r,int x){
	if(l==r){
		s[x]=v[p[l]];
		return;
	}
	int mid=(l+r)>>1;
	build(l,mid,x<<1);
	build(mid+1,r,x<<1|1);
	pushup(x);
}
void ad(int x,int len,ll v){
	d[x]+=v;
	s[x]+=len*v;
}
void pushdown(int x,int ln,int rn){
	if(d[x]){
		ad(x<<1,ln,d[x]);
		ad(x<<1|1,rn,d[x]);
		d[x]=0;
	}
}
void modify(int L,int R,int v,int l,int r,int x){
	if(L>R)return;
	if(L<=l&&r<=R)return ad(x,r-l+1,v);
	int mid=(l+r)>>1;
	pushdown(x,mid-l+1,r-mid);
	if(L<=mid)modify(L,R,v,l,mid,x<<1);
	if(mid<R)modify(L,R,v,mid+1,r,x<<1|1);
	pushup(x);
}
ll query(int L,int R,int l,int r,int x){
	if(L>R)return 0;
	if(L<=l&&r<=R)return s[x];
	int mid=(l+r)>>1;
	ll s=0;
	pushdown(x,mid-l+1,r-mid);
	if(L<=mid)s+=query(L,R,l,mid,x<<1);
	if(mid<R)s+=query(L,R,mid+1,r,x<<1|1);
	return s;
}
int lca(int x,int y){
	while(bl[x]!=bl[y]){
		if(dep[bl[x]]<dep[bl[y]])swap(x,y);
		x=fa[bl[x]];
	}
	return dep[x]<dep[y]?x:y;
}
void modify(int x,int y,int v){
	int u=lca(x,y);
	while(bl[x]!=bl[u]){
		modify(L[bl[x]],R[x],v,1,n,1);
		x=fa[bl[x]];
	}
	while(bl[y]!=bl[u]){
		modify(L[bl[y]],R[y],v,1,n,1);
		y=fa[bl[y]];
	}
	if(dep[x]>dep[y])swap(x,y);
	modify(L[x],R[y],v,1,n,1);
	modify(pos[x],pos[x],v,1,n,1);
	if(fa[x])modify(pos[fa[x]],pos[fa[x]],v,1,n,1);
}
ll query(int x,int y){
	int u=lca(x,y);
	ll s=0;
	while(bl[x]!=bl[u]){
		s+=query(L[bl[x]],R[x],1,n,1);
		x=fa[bl[x]];
	}
	while(bl[y]!=bl[u]){
		s+=query(L[bl[y]],R[y],1,n,1);
		y=fa[bl[y]];
	}
	if(dep[x]>dep[y])swap(x,y);
	s+=query(L[x],R[y],1,n,1)+query(pos[x],pos[x],1,n,1);
	if(fa[x])s+=query(pos[fa[x]],pos[fa[x]],1,n,1);
	return s;
}
int main(){
	int m,i,x,y,z;
	scanf("%d",&n);
	for(i=1;i<n;i++){
		scanf("%d%d",&x,&y);
		add(x,y);
		add(y,x);
	}
	for(i=1;i<=n;i++)scanf("%d",v+i);
	dfs(1);
	M=1;
	p[1]=1;
	pos[1]=1;
	dfs(1,1);
	build(1,n,1);
	scanf("%d",&m);
	while(m--){
		scanf("%d%d%d",&i,&x,&y);
		if(i==1){
			scanf("%d",&z);
			modify(x,y,z);
		}else
			printf("%lld\n",query(x,y));
	}
}

转载于:https://www.cnblogs.com/jefflyy/p/9345944.html