【LCA】P4281 [AHOI2008]紧急集合 / 聚会

P4281 [AHOI2008]紧急集合 / 聚会

#include<cstdio>
#include<iostream>
#include<algorithm>
#include<cstring>
#include<queue>
#include<vector>
#include<stdlib.h>
#include <math.h>
#define  LL long long
using namespace std;

//LCA
const int maxn = 5e5 + 10;
int n, m, s;
int k = 0;
int head[maxn], de[maxn], lg[maxn], Fa[maxn][21];//de表示节点深度,Fa表示该节点的2的x次方的父节点
int tot = 0;
struct node {
	int nxt;
	int to;
}e[maxn * 2];//存图链式前向星

inline void add(int u, int v) {
	e[++tot].to = v;
	e[tot].nxt = head[u];
	head[u] = tot;
}

inline void dfs(int u, int fa) {
	de[u] = de[fa] + 1;
	Fa[u][0] = fa;
	for (int i = 1; (1 << i) <= de[u]; i++) {
		Fa[u][i] = Fa[Fa[u][i - 1]][i - 1];
	}

	for (int i = head[u], v; i != -1; i = e[i].nxt) {
		v = e[i].to;
		if (v != fa) {
			dfs(v, u);
		}
	}
}
int lca(int a, int b) {//lca
	if (de[a] > de[b]) {
		swap(a, b);
	}
	for (int i = 20; i >= 0; i--) {
		if (de[a] <= de[b] - (1 << i)) {
			b = Fa[b][i];
		}
	}
	if (a == b) return a;
	for (int i = 20; i >= 0; i--) {
		if (Fa[a][i] == Fa[b][i]) {
			continue;
		}
		else {
			a = Fa[a][i];
			b = Fa[b][i];
		}
	}
	return Fa[a][0];

}




int main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
	memset(head, -1, sizeof(head));//
	cin >> n >> m;
	for (int i = 1, x, y; i < n; i++) {
		cin >> x >> y;//无向图
		add(x, y);
		add(y, x);
	}
	dfs(1, 0);//通过dfs来为查找lca做预处理
	//for (int i = 1; i <= n; i++)								//常数优化 
	//	lg[i] = lg[i - 1] + (1 << lg[i - 1] == i);

	for (int i = 1, a, b, c, t1, t2, t3, k; i <= m; i++) {
		cin >> a >> b >> c;//查找三个点,容易推理得出,三个点一定有两个lca重合,并且可以推断出选择另外一个lca可以得到最短路
		t1 = lca(a, b), t2 = lca(a, c), t3 = lca(b, c);
		if (t1 == t2)
			k = t3;
		else if (t1 == t3)
			k = t2;
		else if (t2 == t3)
			k = t1;
		LL ans = de[a] + de[b] + de[c] - de[t1] - de[t2] - de[t3];
		cout << k << ' ' << ans << endl;
	}


}