【ybt高效进阶4-5-3】树上距离

树上距离

题目链接：ybt高效进阶4-5-3

题目大意

给你一棵有边权的树，多组询问每次求两个点之间的树上距离。

思路

直接上 LCA，没什么好说的。

代码

#include<cstdio>
#include<algorithm>

using namespace std;

struct node {
	int x, to, nxt;
}e[40001];
int n, m, le[10001], KK, x, y, z;
int fa[21][10001], dis[21][10001];
int deg[10001];

void add(int x, int y, int z) {
	e[++KK] = (node){z, y, le[x]}; le[x] = KK;
	e[++KK] = (node){z, x, le[y]}; le[y] = KK;
}

void dfs(int now, int father) {
	deg[now] = deg[father] + 1;
	for (int i = le[now]; i; i = e[i].nxt)
		if (e[i].to != father) {
			fa[0][e[i].to] = now;
			dis[0][e[i].to] = e[i].x;
			dfs(e[i].to, now);
		}
}

int lca(int x, int y) {
	if (deg[y] > deg[x]) swap(x, y);
	for (int i = 20; i >= 0; i--)
		if (deg[fa[i][x]] >= deg[y])
			x = fa[i][x];
	if (x == y) return x;
	
	for (int i = 20; i >= 0; i--)
		if (fa[i][x] != fa[i][y]) {
			x = fa[i][x];
			y = fa[i][y];
		}
	return fa[0][x];
}

int work(int x, int y) {
	int LCA = lca(x, y);
	if (LCA == x) return dis[20][y] - dis[20][x];
	if (LCA == y) return dis[20][x] - dis[20][y];
	return dis[20][x] + dis[20][y] - 2 * dis[20][LCA];
}

int main() {
	scanf("%d %d", &n, &m);
	
	for (int i = 1; i < n; i++) {
		scanf("%d %d %d", &x, &y, &z);
		add(x, y, z);
	}
	
	dfs(1, 0);
	for (int i = 1; i <= 20; i++)
		for (int j = 1; j <= n; j++) {
			fa[i][j] = fa[i - 1][fa[i - 1][j]];
			dis[i][j] = dis[i - 1][j] + dis[i - 1][fa[i - 1][j]];
		}
	
	while (m--) {
		scanf("%d %d", &x, &y);
		printf("%d\n", work(x, y));
	}
	
	return 0;
}