题目给出的图不一定连通,可以虚拟一个根节点。查询时,若LCA(u, v)为根节点,则表示u,v不相连;否则,求出最短距离。
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <vector>
#include <cmath>
using namespace std;
const int maxn = 10010;
int n, m, c, cnt;
int e[maxn<<1], r[maxn], d[maxn<<1];
bool vis[maxn];
int dp[maxn<<1][20], set[maxn];
struct Node
{
int v, dis;
}node;
vector<Node> son[maxn];
inline int _min(int i, int j)
{
if (d[i] < d[j]) return i;
return j;
}
int find(int x)
{
if (x != set[x])
set[x] = find(set[x]);
return set[x];
}
void Union(int x, int y)
{
x = find(x);
y = find(y);
set[x] = y;
}
void dfs(int u, int dis)
{
vis[u] = true;
e[cnt] = u;
d[cnt] = dis;
r[u] = cnt;
++cnt;
int size = son[u].size();
for (int i = 0; i < size; ++i)
{
if (!vis[son[u][i].v])
{
dfs(son[u][i].v, dis + son[u][i].dis);
e[cnt] = u;
d[cnt] = dis;
++cnt;
}
}
}
void initRMQ()
{
int nn = 2 * n - 1;
for (int i = 0; i < nn; ++i)
dp[i][0] = i;
int k = (int)(log(nn * 1.0) / log(2.0));
for (int j = 1; j <= k; ++j)
{
for (int i = 0; i + (1 << j) - 1 < nn; ++i)
dp[i][j] = _min(dp[i][j-1], dp[i+(1<<(j-1))][j-1]);
}
}
inline int query(int l, int r)
{
int k = (int)(log(r * 1.0 - l + 1) / log(2.0));
return _min(dp[l][k], dp[r-(1<<k)+1][k]);
}
int main()
{
while (scanf("%d %d %d", &n, &m, &c) != EOF)
{
n++;
for (int i = 0; i <= n; ++i)
{
vis[i] = false;
set[i] = i;
son[i].clear();
}
int u, v, len;
for (int i = 0; i < m; ++i)
{
scanf("%d %d %d", &u, &v, &len);
Union(u, v);
node.dis = len;
node.v = v;
son[u].push_back(node);
node.v = u;
son[v].push_back(node);
}
for (int i = 1; i < n; ++i)
{
if (set[i] == i)
{
node.dis = 1;
node.v = i;
son[n].push_back(node);
}
}
cnt = 0;
dfs(n, 0);
initRMQ();
for (int i = 0; i < c; ++i)
{
int idx;
scanf("%d %d", &u, &v);
if (r[u] <= r[v])
idx = query(r[u], r[v]);
else idx = query(r[v], r[u]);
if (e[idx] == n)
printf("Not connected\n");
else printf("%d\n", d[r[u]] + d[r[v]] - 2 * d[idx]);
}
}
return 0;
}