HDU 5296 Annoying problem （树剖求LCA+链的距离）

#include<bits/stdc++.h>
using namespace std;
#define debug cout<<"YES\n";
#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 mst(a,b) memset((a),(b),sizeof(a))
#define pii pair<int,int>
#define piii pair<pii,int>
#define fi first                                  
#define se second
#define mk(x,y) make_pair(x,y)
#define sc(x) scanf("%d",&x)
#define scc(x,y) scanf("%d%d",&x,&y)
#define sccc(x,y,z) scanf("%d%d%d",&x,&y,&z)
const int mod=201314;
const int maxn=1e5+5;
const int lz=0;
const ll INF=1e18;
ll powmod(ll x,ll y){ll t; for(t=1;y;y>>=1,x=x*x%mod) if(y&1) t=t*x%mod; return t;}
ll gcd(ll x,ll y){if(y==0) return x;return gcd(y,x%y);}
///链向星
vector<pii> g[maxn];
int n,q,val[maxn];
set<int> st;
///树链剖分
int dep[maxn],fa[maxn],son[maxn],sz[maxn];
void dfs1(int u,int f){
    dep[u]=dep[f]+1,fa[u]=f,sz[u]=1,son[u]=0;
    for(auto v:g[u]) if(v.fi!=f){
        dfs1(v.fi,u);
        sz[u]+=sz[v.fi];
        if(sz[v.fi]>sz[son[u]]) son[u]=v.fi;
    }
}
int top[maxn],dfn[maxn],cnt=0,mp[maxn];
void dfs2(int u,int f,int pre){
    top[u]=f,dfn[u]=++cnt,mp[cnt]=u,val[cnt]=pre;
    if(son[u]){
        int tmp=0;
        for(auto i:g[u]) if(i.fi==son[u]){
            tmp=i.se;
            break;
        }
        dfs2(son[u],f,tmp);
    }
    for(auto v:g[u]) if(v.fi!=fa[u]&&v.fi!=son[u])
        dfs2(v.fi,v.fi,v.se);
}
///处理查询
int Q(int x,int y){
    int ret=0;
    while(top[x]^top[y]){
        if(dep[top[x]]<dep[top[y]]) swap(x,y);
        ret+=val[dfn[x]]-val[dfn[top[x]]-1];
        x=fa[top[x]];
    }
    if(dep[x]>dep[y]) swap(x,y);
    ret+=val[dfn[y]]-val[dfn[x]];
    return ret;
}
set<int>::iterator it;
int vis[maxn];
int op(int x){
    int p,q;
    x=dfn[x],it=st.lower_bound(x);
    if(it==st.begin()||it==st.end()){
        p=(*st.begin()),q=(*(--st.end()));
    }else{ 
        p=(*it),q=(*(--it));
    }
    x=mp[x],p=mp[p],q=mp[q];
    return ((Q(x,p)+Q(x,q)-Q(p,q))>>1);
}
int main(){
    ios::sync_with_stdio(false);/*
    freopen("d://in.txt","r",stdin);
    freopen("d://out.txt","w",stdout);*/
    int t;cin>>t;
    for(int _=1;_<=t;_++){
        cin>>n>>q;///初始化
        st.clear();
        mst(vis,0),cnt=0;
        rep(i,1,n+1) g[i].clear();
        rep(i,1,n){
            int x,y,z;
            cin>>x>>y>>z;
            g[x].push_back(mk(y,z));
            g[y].push_back(mk(x,z));
        }
        dfs1(1,0),dfs2(1,1,0);
        rep(i,1,n+1) val[i]+=val[i-1];
        int ans=0;
        cout<<"Case #"<<_<<":\n";
        rep(i,0,q){
            int x,y;
            cin>>x>>y;
            if(x==1){
                if(!vis[y]){
                    vis[y]=1;
                    if(st.size()) ans+=op(y);
                    st.insert(dfn[y]);
                }
            }else{
                if(vis[y]){
                    vis[y]=0;
                    it=st.lower_bound(dfn[y]);
                    st.erase(it);
                    if(st.size()) ans-=op(y);
                }
            }
            cout<<ans<<"\n";
        }
    }
    return 0;
}