Problem
acm.hdu.edu.cn/showproblem.php?pid=2586
Meaning
给一棵 n 个点的树,和 n-1 条边的边权,多次询问树上两点的距离。
Analysis
以任意顶点为根,DFS 预处理出所有结点的深度depth、到树根的距离dis。询问 a、b 时,求 c = LCA(a,b),答案就是dis[a] + dis[b] - 2 * dis[c]
Code
#include <cstdio>
#include <algorithm>
#include <vector>
using namespace std;
const int N = 40000, LOG_N = 16;
struct edge
{
int to, c;
edge(int _t = 0, int _c = 0) :
to(_t), c(_c) {}
};
vector<edge> g[N+1];
int depth[N+1]; // 高度(边权为1的到根距离)
int dis[N+1]; // 到根距离
int pa[N+1][LOG_N+1]; // pa[i][j]:i往上跳2^j个点是哪个点
void dfs(int now, int fa, int level, int d)
{
depth[now] = level;
dis[now] = d;
pa[now][0] = fa;
for(int i = 0; i < g[now].size(); ++i)
if(g[now][i].to != fa)
dfs(g[now][i].to, now, level + 1, d + g[now][i].c);
}
void init(int n)
{
dfs(1, -1, 0, 0);
for(int k = 0; 1 << k + 1 < n; ++k)
for(int v = 1; v <= n; ++v)
if(pa[v][k] < 0)
pa[v][k+1] = -1;
else
pa[v][k+1] = pa[pa[v][k]][k];
}
int lca(int x, int y)
{
// 令 y 是更矮的
if(depth[x] > depth[y])
swap(x, y);
// y 跳到与 x 同层
for(int i = 0, j = depth[y] - depth[x]; j > 0; j >>= 1, ++i)
if(j & 1)
y = pa[y][i];
if(x == y)
return x;
for(int k = LOG_N - 1; ~k; --k)
if(pa[x][k] != pa[y][k])
{
x = pa[x][k];
y = pa[y][k];
}
// 还差一步才跳到 LCA
return pa[x][0];
}
int main()
{
int T;
scanf("%d", &T);
while(T--)
{
int n, m;
scanf("%d%d", &n, &m);
for(int i = 1, f, t, c; i < n; ++i)
{
scanf("%d%d%d", &f, &t, &c);
g[f].push_back(edge(t, c));
g[t].push_back(edge(f, c));
}
init(n);
for(int x, y, a; m--; )
{
scanf("%d%d", &x, &y);
a = lca(x, y);
printf("%d\n", dis[x] + dis[y] - dis[a] * 2);
}
for(int i = 1; i <= n; ++i)
g[i].clear();
}
return 0;
}