hdu2586（最近公共祖先）

How far away ？

Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 15988 Accepted Submission(s): 6093

Problem Description
There are n houses in the village and some bidirectional roads connecting them. Every day peole always like to ask like this “How far is it if I want to go from house A to house B”? Usually it hard to answer. But luckily int this village the answer is always unique, since the roads are built in the way that there is a unique simple path(“simple” means you can’t visit a place twice) between every two houses. Yout task is to answer all these curious people.

Input
First line is a single integer T(T<=10), indicating the number of test cases.
For each test case,in the first line there are two numbers n(2<=n<=40000) and m (1<=m<=200),the number of houses and the number of queries. The following n-1 lines each consisting three numbers i,j,k, separated bu a single space, meaning that there is a road connecting house i and house j,with length k(0

#include <bits/stdc++.h>
using namespace std;
const int N=40001;
vector< pair<int,int> > vec[N],vrc[N];
int pre[N];
int vis[N];
int dis[N];
int ans[N];
int haspre[N];
void init(int n){
    for(int i=1;i<=n;i++){
        vec[i].clear();
        vrc[i].clear();
        pre[i]=i;
    }
    memset(vis,0,sizeof(vis));
    memset(dis,0,sizeof(dis));
    memset(ans,0,sizeof(ans));
    memset(haspre,0,sizeof(haspre));
}
int Find(int x){
    return x==pre[x]?x:Find(pre[x]);
}
void join(int x,int y){
    int fx=Find(x);
    int fy=Find(y);
    if(fx!=fy){
        pre[fy]=fx;
    }
}
void Trajan(int u,int p,int val){
    dis[u]=val;
    for(auto v:vec[u]){
        if(v.first!=p){
            Trajan(v.first,u,val+v.second);
            join(u,v.first);
            vis[v.first]=1;
        }
    }
    for(auto e:vrc[u]){
        if(vis[e.first]){
            ans[e.second]=dis[e.first]+dis[u]-2*dis[Find(e.first)];
        }
    }
}
int main(){
    int T;
    scanf("%d",&T);
    while(T--){
        int n,m;
        scanf("%d %d",&n,&m);
        init(n);
        for(int i=0;i<n-1;i++){
            int u,v,w;
            scanf("%d %d %d",&u,&v,&w);
            vec[u].push_back({v,w});
            vec[v].push_back({u,w});
            haspre[v]=1;
        }
        for(int i=1;i<=m;i++){
            int u,v;
            scanf("%d %d",&u,&v);
            vrc[u].push_back({v,i});
            vrc[v].push_back({u,i});
        }
        int root;
        for(int i=1;i<=n;i++){
            if(!haspre[i]){
                root=i;
                break;
            }
        }
        Trajan(root,0,0);
        for(int i=1;i<=m;i++){
            printf("%d\n",ans[i]);
        }
    }
    return 0;
}