poj1986 LCA

 

题意：给出一棵树，求任意两点之间的距离

解法：LCA     先求出各个节点到根节点的距离，a，b之间的距离=dist[a]+dist[b]-2*dist[LCA(a,b)]

 

 

#include<iostream>
#include<cstring>
#include<cstdio>
#include<algorithm>
#include<queue>
#include<vector>
#include<stack>
#include<string>
#include<map>
#include<cmath>
#define clr(a,b) memset((a),b,sizeof((a)))
#define PB(x) push_back(x)
#define INF 0xfffffff
using namespace std;

const int maxn=100007;

int tot,head[maxn];
int tot2,head2[maxn];
int dist[maxn],fa[maxn],vis[maxn],in[maxn];

struct node{
    int v,c,next;
}e[maxn*8],e2[maxn*8];


void init()
{
    tot=0,tot2=0;
    memset(dist,0,sizeof(dist));
    memset(fa,0,sizeof(fa));
    memset(vis,0,sizeof(vis));
    memset(in,0,sizeof(in));
    memset(head,-1,sizeof(head));
    memset(head2,-1,sizeof(head2));
}

void add(int a,int b,int d){
    e[tot].v=b;e[tot].c=d;e[tot].next=head[a];head[a]=tot++;
    e[tot].v=a;e[tot].c=d;e[tot].next=head[b];head[b]=tot++;
}

void add2(int a,int b){
    e2[tot2].v=b;e2[tot2].next=head2[a];head2[a]=tot2++;
    e2[tot2].v=a;e2[tot2].next=head2[b];head2[b]=tot2++;
}

int get(int x){
    if(x==fa[x]) return x;
    return fa[x]=get(fa[x]);
}

void lca(int u,int deep){
    fa[u]=u;
    dist[u]=deep;
    vis[u]=1;
    for(int i=head[u];~i;i=e[i].next){
        if(!vis[e[i].v]){
            lca(e[i].v,deep+e[i].c);
            fa[e[i].v]=u;
        }
    }
    for(int i=head2[u];~i;i=e2[i].next){
        if(vis[e2[i].v]){
            e2[i^1].c=e2[i].c=dist[e2[i].v]+dist[e2[i^1].v]-dist[get(e2[i].v)]*2;
        }
    }
}
int n,m;

int main()
{
    freopen("C:\\Users\\yk\\Desktop\\1.in","r",stdin);
    while(~scanf("%d%d",&n,&m)){
        init();
        int a,b,c;
        char ch[5];
        for(int i=0;i<m;++i){
            scanf("%d%d%d%s",&a,&b,&c,ch);
            add(a,b,c);
        }
        int q;
        scanf("%d",&q);
        for(int i=0;i<q;++i){
            scanf("%d%d",&a,&b);
            add2(a,b);
        }
        lca(1,1);
        int j=1;
        for(int i=0;i<q;++i){
            printf("%d\n",e2[j].c);
            j+=2;
        }
    }
    return 0;
}