HDU 6393 Traffic Network in Numazu （树链剖分+线段树）

#include<bits/stdc++.h>
using namespace std;
#define rep(x,y,z) for(int (x)=(y);(x)<(z);(x)++)
#define ll long long
#define lrt int l,int r,int rt
#define lson l,mid,rt<<1
#define rson mid+1,r,rt<<1|1
#define root l,r,rt
#define mst(a,b) memset((a),(b),sizeof(a))
#define pii pair<int,int>
#define fi first                                  
#define se second
#define mk(x,y) make_pair(x,y)
const int maxn=1e5+100;
const int lz=0;
const ll INF=1e18;
///全局变量
int val[maxn],n,q,tx,ty,tid,tz;
struct node{
    int x,y,z;
}edge[maxn];
///线段树
struct segmenttree{
    ll sum[maxn<<2];
    void build(lrt){
        if(l==r) {sum[rt]=val[l];return;}
        int mid=l+r>>1;
        build(lson),build(rson);
        sum[rt]=sum[rt<<1]+sum[rt<<1|1];
    }
    void update(lrt,int pos,int v){
        if(l==r){
            sum[rt]=v;
            return ;
        }
        int mid=l+r>>1;
        if(pos<=mid) update(lson,pos,v);
        if(mid<pos) update(rson,pos,v);
        sum[rt]=sum[rt<<1]+sum[rt<<1|1];
    }
    ll query(lrt,int L,int R){
        if(L<=l&&r<=R) return sum[rt];
        int mid=l+r>>1;
        ll ans=0;
        if(L<=mid) ans+=query(lson,L,R);
        if(mid<R) ans+=query(rson,L,R);
        return ans;
    }
}seg;
///第一次dfs
vector<int> g[maxn];
int fa[maxn],dep[maxn],sz[maxn],son[maxn];
void dfs1(int u,int f){
    sz[u]=1,fa[u]=f,dep[u]=dep[f]+1,son[u]=0;
    rep(i,0,g[u].size()){
        int v=g[u][i];
        if(v==f) continue;
        dfs1(v,u);
        sz[u]+=sz[v];
        if(sz[v]>sz[son[u]]) son[u]=v;
    }
}
///第二次dfs
int tim,dfn[maxn],top[maxn];
void dfs2(int u,int f){///这里的f是top的意思
    dfn[u]=++tim,top[u]=f;
    if(son[u]) dfs2(son[u],f);
    rep(i,0,g[u].size()){
        int v=g[u][i];
        if(v==fa[u]||v==son[u]) continue;/坑点
        dfs2(v,v);
    }
}
ll query(int x,int y){
    ll ans=0;
    while(top[x]^top[y]){
        if(dep[top[x]]<dep[top[y]]) swap(x,y);
        ans+=seg.query(1,n,1,dfn[top[x]],dfn[x]);
        x=fa[top[x]];
    }
    if(dep[x]>dep[y]) swap(x,y);
    ans+=seg.query(1,n,1,dfn[son[x]],dfn[y]);
    return ans;
}
///并茶几
int pre[maxn];
int find(int x){
    return pre[x]==x?x:pre[x]=find(pre[x]);
}
int main(){
    ios::sync_with_stdio(false);/*
    freopen("d://in.txt","r",stdin);
    freopen("d://out.txt","w",stdout);*/
    int t;cin>>t;
    while(t--){
        cin>>n>>q;
        rep(i,1,n+1){
            pre[i]=i;
            g[i].clear();
        }///初始化
        rep(i,1,n+1){
            int x,y,z;
            cin>>x>>y>>z;
            edge[i]=node{x,y,z};
            int fx=find(x),fy=find(y);
            if(fx==fy)  tx=x,ty=y,tid=i,tz=z;
            else{
                pre[fx]=fy;
                g[x].push_back(y);
                g[y].push_back(x);
            }
        }
        tim=0,dfs1(1,0),dfs2(1,0);
        rep(i,1,n+1){
            if(i==tid) continue;
            if(dep[edge[i].x]<dep[edge[i].y])
                swap(edge[i].x,edge[i].y);
            val[dfn[edge[i].x]]=edge[i].z;
        }
        seg.build(1,n,1);
        rep(i,0,q){
            int op,x,y;
            cin>>op>>x>>y;
            if(op){
                ll sum1=query(x,tx)+query(y,ty)+tz;
                ll sum2=query(x,ty)+query(y,tx)+tz;
                ll ans=min(query(x,y),min(sum1,sum2));
                cout<<ans<<"\n";
            }else{
                if(x^tid) seg.update(1,n,1,dfn[edge[x].x],y);
                else tz=y; 
            }
        }
    }
    return 0;
}