倍增法
题目链接
#include<bits/stdc++.h>
using namespace std;
const int N = 5e5 + 10;
int idx, e[N<<1], ne[N<<1], h[N];
int dp[N], fa[N][30];
int n, m, s;
void add (int a, int b) {
e[idx] = b, ne[idx] = h[a], h[a] = idx ++;
}
void bfs () {
memset (dp, 0x3f, sizeof dp);
dp[0] = 0, dp[s] = 1;
queue <int> q;
q.push (s);
while (q.size ()) {
int t = q.front ();
q.pop ();
for (int i = h[t]; ~i;i = ne[i]) {
int j = e[i];
if (dp[j] > dp[t] + 1) {
dp[j] = dp[t] + 1;
q.push (j);
fa[j][0] = t;
for (int k = 1;k <= 20;k ++)
fa[j][k] = fa[fa[j][k-1]][k-1];
}
}
}
}
int lca (int a, int b) {
if (dp[a] < dp[b]) swap (a, b);
for (int k = 20;k >= 0;k --)
if (dp[fa[a][k]] >= dp[b])
a = fa[a][k];
if (a == b) return a;
for (int k = 20;k >= 0;k --)
if (fa[a][k] != fa[b][k])
a = fa[a][k],
b = fa[b][k];
return fa[a][0];
}
int main()
{
memset (h, -1, sizeof h);
cin >> n >> m >> s;
for (int i = 1;i < n;i ++) {
int a, b;
cin >> a >> b;
add (a, b);
add (b, a);
}
bfs ();
while (m --) {
int a, b;
cin >> a >> b;
cout << lca (a, b) << endl;
}
return 0;
}