【HDU 2874 Connections between cities】 LCA

HDU2874
题意 就是给你一个图 没有环 可能联通 可能不联通
问你两个点直接距离 如果不在一个块内输出 “Not connected” 否则输出距离
做法 我们用并查集确定联通快
这样如果两个点在一个块内 那么就输出 dis[a] + dis[b] - 2*dis[LCA(a,b)]
如果不在一个块内 输出 “Not connected”

/*
    if you can't see the repay
    Why not just work step by step
    rubbish is relaxed
    to ljq
*/
#include <cstdio>
#include <cstring>
#include <iostream>
#include <queue>
#include <cmath>
#include <map>
#include <stack>
#include <set>
#include <sstream>
#include <vector>
#include <stdlib.h>
#include <algorithm>
using namespace std;

#define dbg(x) cout<<#x<<" = "<< (x)<< endl
#define dbg2(x1,x2) cout<<#x1<<" = "<<x1<<" "<<#x2<<" = "<<x2<<endl
#define dbg3(x1,x2,x3) cout<<#x1<<" = "<<x1<<" "<<#x2<<" = "<<x2<<" "<<#x3<<" = "<<x3<<endl
#define max3(a,b,c) max(a,max(b,c))
#define min3(a,b,c) min(a,min(b,c))
#define lc (rt<<1)
#define rc (rt<<11)
#define mid ((l+r)>>1)

typedef pair<int,int> pll;
typedef long long ll;
const int inf = 0x3f3f3f3f;
const int _inf = 0xc0c0c0c0;
const ll INF = 0x3f3f3f3f3f3f3f3f;
const ll _INF = 0xc0c0c0c0c0c0c0c0;
const ll mod =  (int)1e9+7;

ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}
ll ksm(ll a,ll b,ll mod){int ans=1;while(b){if(b&1) ans=(ans*a)%mod;a=(a*a)%mod;b>>=1;}return ans;}
ll inv2(ll a,ll mod){return ksm(a,mod-2,mod);}
void exgcd(ll a,ll b,ll &x,ll &y,ll &d){if(!b) {d = a;x = 1;y=0;}else{exgcd(b,a%b,y,x,d);y-=x*(a/b);}}//printf("%lld*a + %lld*b = %lld\n", x, y, d);
const int MAX_N = 40010;
struct edge
{
    int next,v,len;
}E[MAX_N<<1];
int root,eid = 0,cnt = 0,p[MAX_N<<1],depth[MAX_N<<1],first[MAX_N<<1],dir[MAX_N<<1],que[MAX_N<<1],fa[MAX_N];
bool vis[MAX_N];
int dp[MAX_N][20];
void init(int n){for(int i = 1;i<=n;++i) fa[i] = i;eid = 0,cnt = 0,memset(p,-1,sizeof(p)),memset(vis,0,sizeof(vis));}
int Find(int x){if(x==fa[x]) return x;return fa[x] = Find(fa[x]);}
void Merge(int x,int y){x = Find(x),y = Find(y);if(x!=y) fa[x] = y;}
void add(int u,int v,int len){E[eid].len = len;E[eid].v = v;E[eid].next = p[u];p[u] = eid++;}
void dfs(int u,int dep)//dfs建图
{
    vis[u] = true;
    que[++cnt] = u;first[u] = cnt;depth[cnt] = dep;
    for(int i = p[u];i+1;i=E[i].next)
    {
        int v = E[i].v,len = E[i].len;
        if(!vis[v])
        {
            dir[v] = dir[u] + len;
            dfs(v,dep+1);
            que[++cnt] = u,depth[cnt] = dep;
        }
    }
}

//ST表求LCA
void ST(int n)
{
    for(int i = 1;i<=n;++i)
        dp[i][0] = i;
    for(int j = 1;(1<<j)<=n;++j)
    {
        for(int i = 1;i+(1<<j)-1<=n;++i)
        {
            int a = dp[i][j-1], b = dp[i+(1<<(j-1))][j-1];
            dp[i][j] = depth[a]<depth[b]?a:b;
        }
    }
}

//两个节点之间的路径深度最小的就是LCA
int RMQ(int l,int r)
{
    int k = 0;
    while((1<<(k+1))<=r-l+1)
        k++;
    int a = dp[l][k], b = dp[r-(1<<k)+1][k];//保存的是编号
    return depth[a] <depth[b]?a:b;
}
int LCA(int u,int v)
{
    int x = first[u],y = first[v];
    if(x>y) swap(x,y);
    int res = RMQ(x,y);
    return que[res];
}
int main()
{
    int n,m,c;
    while(scanf("%d%d%d",&n,&m,&c)==3)
    {
        init(n);
        for(int i = 1;i<=m;++i)
        {
            int u,v,len;
            scanf("%d%d%d",&u,&v,&len);
            add(u,v,len);
            add(v,u,len);
            Merge(u,v);
        }
        for(int i = 1;i<=n;++i)
        {
            if(Find(i)==i)
            {
                dir[i] = 0;
                dfs(i,1);
            }
        }
        ST(2*n-1);
        while(c--)
        {
            int u,v;
            scanf("%d%d",&u,&v);
            if(Find(u)==Find(v))
            {
                int lca = LCA(u,v);
                printf("%d\n",dir[u]+dir[v] - 2*dir[lca]);
            }
            else printf("Not connected\n");
        }
    }
    return 0;
}