【图论|数据结构】树链剖分(重链)

时间复杂度：
重链剖分O(logn)
线段树O(logn)
m次询问
总：O(m*log(n)*log(n))
板子：

#include<bits/stdc++.h>
#define ll long long
#define rep(i,a,n) for(int i=a;i<=n;i++)
#define per(i,n,a) for(int i=n;i>=a;i--)
#define endl '\n'
#define mem(a,b) memset(a,b,sizeof(a))
#define IO ios::sync_with_stdio(false);cin.tie(0);
using namespace std;
const int INF=0x3f3f3f3f;
const ll inf=0x3f3f3f3f3f3f3f3f;
const int mod=1e9+7;
const int maxn=1e5+5;
int tot,head[maxn];
struct E{
	int to,next;
}edge[maxn<<1];
void add(int u,int v){
	edge[tot].to=v;
	edge[tot].next=head[u];
	head[u]=tot++;
}
int v[maxn],n,m,root;
int fa[maxn],dep[maxn],siz[maxn],son[maxn];
void dfs1(int u,int f){
	fa[u]=f;
	dep[u]=dep[f]+1;
	siz[u]=1;
	int maxsize=-1;
	for(int i=head[u];i!=-1;i=edge[i].next){
		int v=edge[i].to;
		if(v==f) continue;
		dfs1(v,u);
		siz[u]+=siz[v];
		if(siz[v]>maxsize){
			maxsize=siz[v];
			son[u]=v;
		}
	}
}
int tim,dfn[maxn],top[maxn],w[maxn];
void dfs2(int u,int t){
	dfn[u]=++tim;
	top[u]=t;
	w[tim]=v[u];
	if(!son[u]) return ;
	dfs2(son[u],t);
	for(int i=head[u];i!=-1;i=edge[i].next){
		int v=edge[i].to;
		if(v==fa[u]||v==son[u]) continue;
		dfs2(v,v);
	}
}
struct node{
	int l,r,sum,lz;
}tree[maxn<<2];
inline void build(int i,int l,int r){
	tree[i].l=l;tree[i].r=r,tree[i].lz=0;
	if(l==r){
		tree[i].sum=w[l];
		return ;
	}
	ll mid=(l+r)>>1;
	build(2*i,l,mid);
	build(2*i+1,mid+1,r);
	tree[i].sum=tree[2*i].sum+tree[i*2+1].sum;
}
inline void push_down(int i){
    if(tree[i].lz!=0){
        tree[i*2].lz+=tree[i].lz;
        tree[i*2+1].lz+=tree[i].lz;
        ll mid=(tree[i].l+tree[i].r)/2;
        tree[i*2].sum+=tree[i].lz*(mid-tree[i*2].l+1);
        tree[i*2+1].sum+=tree[i].lz*(tree[i*2+1].r-mid);
        tree[i].lz=0;
    }
    return ;
}
inline void modify(int i,int l,int r,int k){
    if(tree[i].r<=r && tree[i].l>=l){
        tree[i].sum+=k*(tree[i].r-tree[i].l+1);
        tree[i].lz+=k;
        return ;
    }
    push_down(i);
    if(tree[i*2].r>=l)
        modify(i*2,l,r,k);
    if(tree[i*2+1].l<=r)
        modify(i*2+1,l,r,k);
    tree[i].sum=tree[i*2].sum+tree[i*2+1].sum;
}
inline int query(int i,int l,int r){
    if(tree[i].l>=l && tree[i].r<=r)  
        return tree[i].sum;
    if(tree[i].r<l || tree[i].l>r)  return 0;
    push_down(i);
    ll s=0;
    if(tree[i*2].r>=l)  s+=query(i*2,l,r);
    if(tree[i*2+1].l<=r)  s+=query(i*2+1,l,r);
    return s;
}
void mchain(int x,int y,int z){
	while(top[x]!=top[y]){
		if(dep[top[x]]<dep[top[y]])
			std::swap(x,y);
		modify(1,dfn[top[x]],dfn[x],z);
		x=fa[top[x]];
	}
	if(dep[x]>dep[y]) std::swap(x,y);
	modify(1,dfn[x],dfn[y],z);
}
int qchain(int x,int y){
	int ret=0;
	while(top[x]!=top[y]){
		if(dep[top[x]]<dep[top[y]]) std::swap(x,y);
		ret+=query(1,dfn[top[x]],dfn[x]);
		x=fa[top[x]];
	}
	if(dep[x]>dep[y]) std::swap(x,y);
	ret+=query(1,dfn[x],dfn[y]);
	return ret;
}
inline void mson(int x,int z){
	modify(1,dfn[x],dfn[x]+siz[x]-1,z);
}
inline int qson(int x){
	return query(1,dfn[x],dfn[x]+siz[x]-1);
}
int main(){
	cin>>n>>m>>root;mem(head,-1);
	for(int i=1;i<=n;i++) cin>>v[i];
	for(int i=1;i<n;i++){
		int u,v;cin>>u>>v;
		add(u,v),add(v,u);
	}
	dfs1(root,root);
	dfs2(root,root);
	build(1,1,n);
	while(m--){
		int op,x,y,z;cin>>op;
		switch(op){
			case 1:
				cin>>x>>y>>z;
				mchain(x,y,z);
				break;
			case 2:
				cin>>x>>y;
				cout<<qchain(x,y)<<endl;
				break;
			case 3:
				cin>>x>>z;
				mson(x,z);
				break;		
			case 4:
				cin>>x;
				cout<<qson(x)<<endl;
				break;
		}
	}
	return 0;
}

UOJ128

#include<bits/stdc++.h>
#define ll long long
#define rep(i,a,n) for(int i=a;i<=n;i++)
#define per(i,n,a) for(int i=n;i>=a;i--)
#define endl '\n'
#define mem(a,b) memset(a,b,sizeof(a))
#define IO ios::sync_with_stdio(false);cin.tie(0);
using namespace std;
const int INF=0x3f3f3f3f;
const ll inf=0x3f3f3f3f3f3f3f3f;
const int mod=1e9+7;
const int maxn=1e5+5;
int tot,head[maxn];
struct E{
	int to,next;
}edge[maxn<<1];
void add(int u,int v){
	edge[tot].to=v;
	edge[tot].next=head[u];
	head[u]=tot++;
}
int fa[maxn],dep[maxn],siz[maxn],son[maxn];
void dfs1(int u,int f){
	siz[u]=1;
	dep[u]=dep[f]+1;
	int maxsize=-1;
	for(int i=head[u];i!=-1;i=edge[i].next){
		int v=edge[i].to;
		if(v==f) continue;
		dfs1(v,u);
		siz[u]+=siz[v];
		if(siz[v]>maxsize){
			maxsize=siz[v];
			son[u]=v;
		}
	}
}
int dfn[maxn],w[maxn],top[maxn],tim;
void dfs2(int u,int t){
	dfn[u]=++tim;
	top[u]=t;
	w[tim]=0;
	if(son[u]==-1) return ;
	dfs2(son[u],t);
	for(int i=head[u];i!=-1;i=edge[i].next){
		int v=edge[i].to;
		if(v==fa[u]||v==son[u]) continue;
		dfs2(v,v);
	}
}

struct node{
	int l,r,sum,lz;
}tree[maxn<<2];
inline void build(int i,int l,int r){
	tree[i].l=l;tree[i].r=r;tree[i].lz=-1;
	if(l==r){
		tree[i].sum=w[l];
		return ;
	}
	int mid=(l+r)>>1;
	build(2*i,l,mid);
	build(2*i+1,mid+1,r);
	tree[i].sum=tree[i*2].sum+tree[i*2+1].sum;
}
inline void push_down(int i){
    if(tree[i].lz!=-1){
        tree[i*2].lz=tree[i].lz;
        tree[i*2+1].lz=tree[i].lz;
        ll mid=(tree[i].l+tree[i].r)/2;
        tree[i*2].sum=tree[i].lz*(mid-tree[i*2].l+1);
        tree[i*2+1].sum=tree[i].lz*(tree[i*2+1].r-mid);
        tree[i].lz=-1;
    }
    return ;
}
inline void modify(int i,int l,int r,int k){
    if(tree[i].r<=r && tree[i].l>=l){
        tree[i].sum=k*(tree[i].r-tree[i].l+1);
        tree[i].lz=k;
        return ;
    }
    push_down(i);
    if(tree[i*2].r>=l)
        modify(i*2,l,r,k);
    if(tree[i*2+1].l<=r)
        modify(i*2+1,l,r,k);
    tree[i].sum=tree[i*2].sum+tree[i*2+1].sum;
}
inline int query(int i,int l,int r){
    if(tree[i].l>=l && tree[i].r<=r)  
        return tree[i].sum;
    if(tree[i].r<l || tree[i].l>r)  return 0;
    push_down(i);
    ll s=0;
    if(tree[i*2].r>=l)  s+=query(i*2,l,r);
    if(tree[i*2+1].l<=r)  s+=query(i*2+1,l,r);
    return s;
}
void mchain(int x,int y,int z){
	while(top[x]!=top[y]){
		if(dep[top[x]]<dep[top[y]]) std::swap(x,y);
		modify(1,dfn[top[x]],dfn[x],z);
		x=fa[top[x]];
	}
	if(dep[x]>dep[y]) std::swap(x,y);
	modify(1,dfn[x],dfn[y],z);
}
int qchain(int x,int y){
	int ret=0;
	while(top[x]!=top[y]){
		if(dep[top[x]]<dep[top[y]]) std::swap(x,y);
		ret+=query(1,dfn[top[x]],dfn[x]);
		x=fa[top[x]];
	}
	if(dep[x]>dep[y]) std::swap(x,y);
	ret+=query(1,dfn[x],dfn[y]);
	return ret;
}
inline void mson(int x,int z){
	modify(1,dfn[x],dfn[x]+siz[x]-1,z);
}
inline int qson(int x){
	return query(1,dfn[x],dfn[x]+siz[x]-1);
}
int main(){
	IO;
	int n;cin>>n;mem(head,-1);mem(son,-1);
	fa[0]=0;
	for(int i=1;i<=n-1;i++){
		int x;cin>>x;
		fa[i]=x;
		add(x,i);add(i,x);
	}
	dfs1(0,0);
	dfs2(0,0);
	build(1,1,n);
	int q;cin>>q;
	while(q--){
		string s;cin>>s;
		if(s[0]=='i'){
			int x;cin>>x;
			int ans1=qchain(0,x);
			mchain(0,x,1);
			int ans2=qchain(0,x);
			cout<<ans2-ans1<<endl;
		}
		else if(s[0]=='u'){
			int x;cin>>x;
			int ans1=qson(x);
			mson(x,0);
			int ans2=qson(x);
			cout<<ans1-ans2<<endl;	
		}
	}
}

SDOI2011 染色

#include<bits/stdc++.h>
#define ll long long
#define rep(i,a,n) for(int i=a;i<=n;i++)
#define per(i,n,a) for(int i=n;i>=a;i--)
#define endl '\n'
#define mem(a,b) memset(a,b,sizeof(a))
#define IO ios::sync_with_stdio(false);cin.tie(0);
using namespace std;
const int INF=0x3f3f3f3f;
const ll inf=0x3f3f3f3f3f3f3f3f;
const int mod=1e9+7;
const int maxn=2e5+5;
int tot,head[maxn];
struct E{
	int to,next;
}edge[maxn<<1];
void add(int u,int v){
	edge[tot].to=v;
	edge[tot].next=head[u];
	head[u]=tot++;
}
int n,m,v[maxn];
int siz[maxn],dep[maxn],fa[maxn],son[maxn];
void dfs1(int u,int f){
	fa[u]=f;dep[u]=dep[f]+1;siz[u]=1;
	int maxsize=-1;
	for(int i=head[u];i!=-1;i=edge[i].next){
		int v=edge[i].to;
		if(v==f) continue;
		dfs1(v,u);
		siz[u]+=siz[v];
		if(siz[v]>maxsize){
			maxsize=siz[v];
			son[u]=v;
		}
	}
}
int dfn[maxn],w[maxn],top[maxn],tim;
void dfs2(int u,int t){
	dfn[u]=++tim;
	top[u]=t;
	w[tim]=v[u];
	if(!son[u]) return ;
	dfs2(son[u],t);
	for(int i=head[u];i!=-1;i=edge[i].next){
		int v=edge[i].to;
		if(v==fa[u]||v==son[u]) continue;
		dfs2(v,v);
	}
}
struct node{
	int l,r,cnt,lz,lc,rc;
}tree[maxn<<2];
inline void build(int i,int l,int r){
	tree[i].l=l;tree[i].r=r;tree[i].lz=-1;
	if(l==r){
		tree[i].cnt=1;
		tree[i].lc=tree[i].rc=w[l];
		return ;
	}
	int mid=(l+r)>>1;
	build(i*2,l,mid);
	build(i*2+1,mid+1,r);
	tree[i].lc=tree[2*i].lc;
	tree[i].rc=tree[2*i+1].rc;
	if(tree[2*i].rc==tree[2*i+1].lc) tree[i].cnt=tree[2*i].cnt+tree[2*i+1].cnt-1;
	else tree[i].cnt=tree[2*i].cnt+tree[2*i+1].cnt;
}
inline void push_down(int i){
	if(tree[i].lz!=-1){
		tree[i*2].lz=tree[i].lz;
		tree[i*2+1].lz=tree[i].lz;
		tree[i].cnt=tree[i*2].cnt=tree[i*2+1].cnt=1;
		tree[i].rc=tree[i].lc=tree[2*i].rc=tree[2*i].lc=tree[2*i+1].lc=tree[2*i+1].rc=tree[i].lz;
		tree[i].lz=-1;
	}
	return ;
}
inline void modify(int i,int l,int r,int k){
	if(tree[i].r<=r&&tree[i].l>=l){
		tree[i].cnt=1;
		tree[i].lz=k;
		tree[i].lc=tree[i].rc=k;
		return ;
	}
	push_down(i);
    if(tree[i*2].r>=l)
        modify(i*2,l,r,k);
    if(tree[i*2+1].l<=r)
        modify(i*2+1,l,r,k);
	if(tree[2*i].rc==tree[2*i+1].lc) tree[i].cnt=tree[2*i].cnt+tree[2*i+1].cnt-1;
	else tree[i].cnt=tree[2*i].cnt+tree[2*i+1].cnt;
	tree[i].lc=tree[2*i].lc;			
	tree[i].rc=tree[2*i+1].rc;			
}
inline int query(int i,int l,int r){
	push_down(i);
	if(tree[i].l==l&&tree[i].r==r)
		return tree[i].cnt;
	int mid=(tree[i].r+tree[i].l)>>1;
	if(r<=mid) return query(2*i,l,r);
	else if(l>mid) return query(2*i+1,l,r);	
	else{
		int a1=query(2*i,l,mid);
		int a2=query(2*i+1,mid+1,r);
		int ans=0;
		if(tree[2*i].rc==tree[2*i+1].lc){
			ans=a1+a2-1;
		}else{
			ans=a1+a2;
		}
		return ans;
	}
}
inline int getcol(int i,int x){
	push_down(i);
	if(tree[i].l==tree[i].r) return tree[i].lc;
	int mid=(tree[i].l+tree[i].r)>>1;
	if(x<=mid) return getcol(2*i,x);
	else return getcol(2*i+1,x);
}
void mchain(int x,int y,int z){
	while(top[x]!=top[y]){
		if(dep[top[x]]<dep[top[y]])
			std::swap(x,y);
		modify(1,dfn[top[x]],dfn[x],z);
		x=fa[top[x]];
	}
	if(dep[x]>dep[y]) std::swap(x,y);
	modify(1,dfn[x],dfn[y],z);
}
int qchain(int x,int y){
	int ret=0;
	while(top[x]!=top[y]){
		if(dep[top[x]]<dep[top[y]]) std::swap(x,y);
		ret+=query(1,dfn[top[x]],dfn[x]);
		if(getcol(1,dfn[top[x]])==getcol(1,dfn[fa[top[x]]])) ret-=1;
		x=fa[top[x]];
	}
	if(dep[x]>dep[y]) std::swap(x,y);
	ret+=query(1,dfn[x],dfn[y]);
	return ret;
}
int main(){
	cin>>n>>m;mem(head,-1);
	rep(i,1,n) cin>>v[i];
	for(int i=1;i<n;i++){
		int u,v;cin>>u>>v;
		add(u,v),add(v,u);
	}
	dfs1(1,-1);
	dfs2(1,1);
	build(1,1,n);
	while(m--){
		char s;cin>>s;
		if(s=='Q'){
			int u,v;cin>>u>>v;
			cout<<qchain(u,v)<<endl;
		}
		else if(s=='C'){
			int u,v,w;cin>>u>>v>>w;
			mchain(u,v,w);
		}
	}
}