HDU 2586 How far away ？

How far away ？

题意：建一棵树，n个点，n-1条边，有权值，然后q次询问，每次求两个节点的连线最短距离。

思路：LCA

解题方法:(还有待理解，怕说错)

注意:vector会爆栈，需要加第一行代码然后C++可过，据说是服务器略坑，不过手写邻接表模拟（可参考 HDU 2874 题解）应该就不用担心了（然后并软用，还是得加上那行代码才让过，醉了）

参考AC代码:

#pragma comment(linker, "/STACK:1024000000,1024000000")
#include<iostream>
#include<cstring>
#include<cstdio>
#include<vector>
using namespace std;
#define N 50010
vector<int>v[N],w[N],q[N],num[N];
int dis[N],pre[N],ans[N];
bool vis[N];
int n;
void init(){
    for(int i=1;i<=n;i++){
        v[i].clear();
        w[i].clear();
        q[i].clear();
        num[i].clear();
        pre[i]=i;
        dis[i]=0;
        vis[i]=false;
    }
}
int find(int x){
    return pre[x]==x?pre[x]:pre[x]=find(pre[x]);
}
void Union(int a,int b){
    int p=find(a);
    int q=find(b);
    if(p!=q){
        pre[q]=p;
    }
}
void Tarjan(int cur,int val){
    vis[cur]=true;
    dis[cur]=val;
    for(int i=0;i<v[cur].size();i++){
        int tmp = v[cur][i];
        if(!vis[tmp]){
            Tarjan(tmp,val+w[cur][i]);
            Union(cur,tmp);
        }
    }
    for(int i=0;i<q[cur].size();i++){
        int tmp = q[cur][i];
        if(vis[tmp]){
            ans[num[cur][i]] = dis[cur]+dis[tmp]-2*dis[find(tmp)];
        }
    }
}
int main(){
    int T;
    scanf("%d",&T);
    while(T--){
        int Q,a,b,c;
        scanf("%d%d",&n,&Q);
        init();
        for(int i=0;i<n-1;i++){
            scanf("%d%d%d",&a,&b,&c);
            v[a].push_back(b);
            v[b].push_back(a);
            w[a].push_back(c);
            w[b].push_back(c);
        }
        for(int i=0;i<Q;i++){
            scanf("%d%d",&a,&b);
            q[a].push_back(b);
            q[b].push_back(a);
            num[a].push_back(i);
            num[b].push_back(i);
        }
        Tarjan(1,0);
        for(int i=0;i<Q;i++){
            printf("%d\n",ans[i]);
        }
    }
    return 0;
}

结构体vector实现:

#pragma comment(linker, "/STACK:1024000000,1024000000")
#include<iostream>
#include<cstdio>
#include<cstring>
#include<vector>
using namespace std;
#define N 50010
struct Node{
    int v,len;
};
vector<Node>road[N];
struct Query{
    int u,v,id;
};
vector<Query>que[N];
bool vis[N];
int pre[N],dis[N],ans[N];
int n,q;
void init(){
    for(int i=0;i<=n;i++){
        pre[i]=i;
        vis[i]=false;
        road[i].clear();
        que[i].clear();
    }

}
int find(int x){
    return pre[x]==x?pre[x]:pre[x]=find(pre[x]);
}
void Union(int x,int y){
    x=find(x);
    y=find(y);
    if(x!=y){
        pre[y]=x;
    }
}
void Tarjan(int cur,int val){
    dis[cur]=val;
    vis[cur]=true;
    for(int i=0;i<road[cur].size();i++){
        int tmp = road[cur][i].v;
        if(!vis[tmp]){
            Tarjan(tmp,val+road[cur][i].len);
            Union(cur,tmp);
        }
    }
    for(int i=0;i<que[cur].size();i++){
        int tmp = que[cur][i].v;
        if(vis[tmp]){
            ans[que[cur][i].id] = dis[cur]+dis[tmp]-2*dis[find(tmp)];
        }
    }
}
int main(){
    int T;
    scanf("%d",&T);
    while(T--){
        int a,b,c;
        scanf("%d%d",&n,&q);
        init();
        for(int i=0;i<n-1;i++){
            scanf("%d%d%d",&a,&b,&c);
            //cin>>ch;
            Node t;
            t.len=c;
            t.v=b;
            road[a].push_back(t);
            t.v=a;
            road[b].push_back(t);
        }
        for(int i=0;i<q;i++){
            scanf("%d%d",&a,&b);
            Query t;
            t.id=i;
            t.u=a;
            t.v=b;
            que[a].push_back(t);
            t.u=b;
            t.v=a;
            que[b].push_back(t);
        }
        Tarjan(1,0);
        for(int i=0;i<q;i++){
            printf("%d\n",ans[i]);
        }
    }
    return 0;
}

邻接表模拟:

#pragma comment(linker, "/STACK:1024000000,1024000000")
#include<iostream>
#include<cstdio>
#include<cstring>
#include<vector>
using namespace std;
#define N 50010
#define M 500
struct Edge
{
    int v,len,next;
} edge[N*2];
int tot,head[N];
void add(int a,int b,int c)
{
    edge[tot].v=b;
    edge[tot].len=c;
    edge[tot].next=head[a];
    head[a]=tot++;

    edge[tot].v=a;
    edge[tot].len=c;
    edge[tot].next=head[b];
    head[b]=tot++;
}
struct Query{
    int v,index,next;
};
Query Q[M];
int q_tot,q_head[N];
void add_ques(int a,int b,int index)
{
    Q[q_tot].v=b;
    Q[q_tot].index=index;
    Q[q_tot].next=q_head[a];
    q_head[a]=q_tot++;

    Q[q_tot].v=a;
    Q[q_tot].index=index;
    Q[q_tot].next=q_head[b];
    q_head[b]=q_tot++;
}
bool vis[N];
int pre[N],dis[N],ans[M];
int n,q;
void init(){
    for(int i=0;i<=n;i++){
        pre[i]=i;
        vis[i]=false;
    }
    tot=q_tot=0;
    memset(q_head,-1,sizeof(q_head));
    memset(head,-1,sizeof(head));
    memset(ans,-1,sizeof(ans));
    //memset(root,true,sizeof(root));
}
int find(int x){
    return pre[x]==x?pre[x]:pre[x]=find(pre[x]);
}
void Union(int x,int y){
    x=find(x);
    y=find(y);
    if(x!=y){
        pre[y]=x;
    }
}
void Tarjan(int cur,int val){
    dis[cur]=val;
    vis[cur]=true;
    for(int j=head[cur]; j!=-1; j=edge[j].next)
    {
        int v=edge[j].v;
        if(vis[v])    continue;
        Tarjan(v,val+edge[j].len);
        Union(cur,v);
    }
    for(int j=q_head[cur]; j!=-1; j=Q[j].next)
    {
        int v=Q[j].v;
        if(!vis[v])    continue;
        ans[Q[j].index]=dis[v]+dis[cur]-2*dis[find(v)];
    }
}
int main(){
    int T,m;
    scanf("%d",&T);
    while(T--){
        int a,b,c;
        scanf("%d%d",&n,&q);
        init();
        for(int i=0;i<n-1;i++){
            scanf("%d%d%d",&a,&b,&c);
            add(a,b,c);
            //root[b]=false;
        }
        for(int i=0;i<q;i++){
            scanf("%d%d",&a,&b);
            add_ques(a,b,i);

        }
        Tarjan(1,0);
        for(int i=0;i<q;i++){
           printf("%d\n",ans[i]);
        }
    }
    return 0;
}