HDU - 2874 Connections between cities (LCA)

HDU - 2874 题目

思路：求叶子节点间距离，tarjan求lca，然后由u->v的距离就是 d[u] + d[v] - 2 * d[lca(u,v)];

题目已经给出了有不联通的部分，所以给每一次tarjan都赋一个新的值，看询问的u和v是不是在同一个连通图里。

这个题有个坑的地方，有像（u，u）这种询问出现。所以ans[i]的初值不能是0。

#include <cstdio>
#include <iostream>
#include <cstring>
#include <algorithm>

using namespace std;
const int maxn = 1e5;
const int maxq = 1e6+50;

struct node
{
    int to,w,next;
    node(){}
    node(int a,int b,int c = -1)
    {   to = a;w = b; next = c;}
}edge[maxn],qu[maxq << 1];

int f[maxn],  h[maxn],  hq[maxn], ans[maxq];
int col[maxn],vis[maxn],dis[maxn],anc[maxn];
int n,m,q;
int edgenum = 0, qnum = 0;

void init()
{
    for(int i = 1; i <= n ; i++)
        f[i] = i, h[i] = -1, hq[i] = -1,col[i] = 0, vis[i] = 0,dis[i] = 0;
    for(int i = 0; i < q ; i++) ans[i] = -1;

    edgenum = 0; qnum = 0;
}

void add(int f,int t,int w)
{
    edge[edgenum] = node(t , w , h[f]);
    h[f] = edgenum++;
}
void addq(int f,int t,int id)
{
    qu[qnum] = node(t,id,hq[f]);
    hq[f] = qnum++;
}
int getf(int i)
{   return f[i] == i ? i : f[i] = getf(f[i]);   }
void join(int a,int b)
{
    int x = getf(a), y = getf(b);
    if(x != y) f[y] = x;
}
void tarjan(int u,int th)
{
    anc[u] = u;
    for(int i = h[u]; ~i ; i = edge[i].next)
    {
        int v = edge[i].to;
        if(!vis[v])
        {
            vis[v] = 1;
            dis[v] = dis[u] + edge[i].w;
            tarjan(v, th);
            join(u,v);
            anc[getf(u)] = u;
            vis[v] = 0;
        }
    }

    col[u] = th;

    for(int i = hq[u] ; ~i; i = qu[i].next)
    {
        int v = qu[i].to, id = qu[i].w;
        if(col[v] != th) continue;
        ans[id] = dis[u] + dis[v] - 2 * dis[anc[getf(v)]];
    }
}
int main()
{
    int a,b,c;
    while(~scanf("%d%d%d",&n,&m,&q))
    {
        init();
        for(int i = 0; i < m ; i++)
        {
            scanf("%d%d%d",&a,&b,&c);
            add(a,b,c);  add(b,a,c);
        }
        for(int i = 0; i < q; i++)
        {
            scanf("%d%d",&a,&b);
            addq(a,b,i); addq(b,a,i);
        }
        int num = 1;
        for(int i = 1; i <= n; i++)
            if(!col[i]) {dis[i] = 0,vis[i] = 1;tarjan(i,num++); vis[i] = 0;}
        for(int i = 0; i < q; i++)
            ans[i] == -1?printf("Not connected\n") : printf("%d\n", ans[i]);
    }
    return 0;
}