bzoj3083 遥远的国度（树链剖分+换根）

树链剖分基本操作，换根其实就是把dfs序列分裂，倍增找一下当前rt到询问点x的儿子，把这一段区间去掉即可。

#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define inf 0x7fffffff
#define N 100010
inline char gc(){
    static char buf[1<<16],*S,*T;
    if(T==S){T=(S=buf)+fread(buf,1,1<<16,stdin);if(T==S) return EOF;}
    return *S++;
}
inline int read(){
    int x=0,f=1;char ch=gc();
    while(ch<'0'||ch>'9'){if(ch=='-') f=-1;ch=gc();}
    while(ch>='0'&&ch<='9') x=x*10+ch-'0',ch=gc();
    return x*f;
}
int n,m,h[N],num=0,in[N],out[N],tp[N],dfn=0,son[N],sz[N],fa[N][20],dep[N],rt,Log[N];
struct edge{
    int to,next;
}data[N<<1];
struct node{
    int mn,tag;
}tr[N<<2];
inline void dfs1(int x){
    for(int i=1;i<=Log[n];++i){
        if(!fa[x][i-1]) break;
        fa[x][i]=fa[fa[x][i-1]][i-1];
    }sz[x]=1;son[x]=0;
    for(int i=h[x];i;i=data[i].next){
        int y=data[i].to;if(y==fa[x][0]) continue;
        fa[y][0]=x;dep[y]=dep[x]+1;dfs1(y);sz[x]+=sz[y];
        if(sz[y]>sz[son[x]]) son[x]=y;
    }
}inline void dfs2(int x,int top){
    tp[x]=top;in[x]=++dfn;
    if(son[x]) dfs2(son[x],top);
    for(int i=h[x];i;i=data[i].next){
        int y=data[i].to;if(y==fa[x][0]||y==son[x]) continue;dfs2(y,y);
    }out[x]=dfn;
}
inline void pushup(int p){
    tr[p].mn=min(tr[p<<1].mn,tr[p<<1|1].mn);
}
inline void dotag(int p,int val){
    tr[p].tag=val;tr[p].mn=val;
}
inline void pushdown(int p){
    if(!tr[p].tag) return;dotag(p<<1,tr[p].tag);dotag(p<<1|1,tr[p].tag);tr[p].tag=0;
}
inline void change(int p,int l,int r,int x,int y,int val){
    if(x<=l&&r<=y){dotag(p,val);return;}
    int mid=l+r>>1;pushdown(p);
    if(x<=mid) change(p<<1,l,mid,x,y,val);
    if(y>mid) change(p<<1|1,mid+1,r,x,y,val);pushup(p);
}
inline int ask(int p,int l,int r,int x,int y){
    if(x>y) return inf;
    if(x<=l&&r<=y) return tr[p].mn;
    int mid=l+r>>1;pushdown(p);
    if(y<=mid) return ask(p<<1,l,mid,x,y);
    if(x>mid) return ask(p<<1|1,mid+1,r,x,y);
    return min(ask(p<<1,l,mid,x,mid),ask(p<<1|1,mid+1,r,mid+1,y));
}
inline void dochange(int x,int y,int val){
    while(tp[x]!=tp[y]){
        if(dep[tp[x]]<dep[tp[y]]) swap(x,y);
        change(1,1,n,in[tp[x]],in[x],val);x=fa[tp[x]][0];
    }if(in[x]>in[y]) swap(x,y);
    change(1,1,n,in[x],in[y],val);
}
inline int gao(int x){
    if(dep[x]>=dep[rt]) return ask(1,1,n,in[x],out[x]);
     int y=rt,d=dep[rt]-dep[x]-1;
     for(int i=0;i<=Log[d];++i)
        if(d>>i&1) y=fa[y][i];
     if(fa[y][0]!=x) return ask(1,1,n,in[x],out[x]);
     return min(ask(1,1,n,1,in[y]-1),ask(1,1,n,out[y]+1,n));
}
int main(){
//  freopen("a.in","r",stdin);
    n=read();m=read();Log[0]=-1;
    for(int i=1;i<=n;++i) Log[i]=Log[i>>1]+1;
    for(int i=1;i<n;++i){
        int x=read(),y=read();
        data[++num].to=y;data[num].next=h[x];h[x]=num;
        data[++num].to=x;data[num].next=h[y];h[y]=num;
    }dfs1(1);dfs2(1,1);for(int i=1;i<=n;++i) change(1,1,n,in[i],in[i],read());
    rt=read();while(m--){
        int op=read();if(op==1){rt=read();continue;}
        if(op==3){
            int x=read(),ans;
            if(x==rt) ans=tr[1].mn;
            else ans=gao(x);
            printf("%d\n",ans);continue;
        }int x=read(),y=read();dochange(x,y,read());
    }return 0;
}