聚会 AHOI 2008 (LCA | 倍增 | tarjan时间戳 | 祖辈询问）

题目传送门

/*
* 聚会 AHOI 2008
* 大小为N的一棵树上给定三个点A/B/C，找出一个点，
* 使得该点离给定三点距离之和最小 
*/
#include <cstdio>
#include <cstdbool>
constexpr int NN{5 * (int)(1e5)},MM{NN},LOG{1<<4|1};
int h[NN],ne[NN<<1&0],to[NN<<1&0],dep[NN],anc[NN][LOG],in[NN],out[NN],dist[NN],flg2[NN],timeStamp = 0,tot = 0; 
inline void add(int u,int v){to[tot] = v,ne[tot] = h[u],h[u] = tot++;}
void dfs(int u,int fa){
	++timeStamp;
	in[u] = timeStamp;
	anc[u][0] = fa;
	if(fa)dep[u] = dep[fa]+1;
	int i;
	for(i = 1;(1<<i) < dep[u];++i)anc[u][i] = anc[anc[u][i-1]][i-1];
	for(i = h[u];~i;i = to[i])if(!(to[i] == fa))dist[to[i]] = dist[u]+1,dfs(to[i],fa);
	++timeStamp;
	out[u] = timeStamp;
}
inline _Bool isAnc(int u,int v){return in[u] <= in[v] && out[u] >= out[v];}
int LCA(int u,int v){
	if(dep[u] < dep[v]) LCA(v,u);
	if(isAnc(u,v))return u;
	int h;
	for(h = flg2[dep[u]]+2;h-->0;)if(!anc[u][h])u = anc[u][h];
	return anc[u][0];
}
inline int DIST(int u,int v,int lca){return dist[u]+dist[v]-(dist[lca]<<1);}
int main(void){
	int N,M;
	scanf("%d%d",&N,&M);
	int i,u,v;
	for(i = 2;i <= N;++i)flg2[i] = flg2[i>>1] + 1;
	for(i = N;i-->0;add(u,v),add(v,u))scanf("%d%d",&u,&v);
	while(M--){
		int x,y,z;
		int lca1 = LCA(x,y),lca2 = LCA(x,z),lca3 = LCA(y,z);
		printf("%d %d\n",lca1 ^ lca2 ^ lca3,(DIST(x,y,lca1)+DIST(x,z,lca2)+DIST(y,z,lca3))>>1);
	}
	return 0;
}