P3379 【模板】最近公共祖先（LCA）

【模板】最近公共祖先（LCA） - 洛谷https://www.luogu.com.cn/problem/P3379

#include <iostream>
#include <cstdio>
#include <string>
#include <algorithm>
#include <vector>
#include <queue>
#include <stack>
#include <cstring>
#include <set>
#include <unordered_map>
#include <cmath>
#include <map>
#include <cctype>
#include <cstdlib>
#include <deque>
typedef long long ll;
typedef unsigned long long ull;
using namespace std;
const int MN = 65005;
const int MAXN = 1000010;
const int INF = 0x3f3f3f3f;
#define IOS ios::sync_with_stdio(false)
#define lowbit(x) ((x)&(-x))

//倍增LCA
int head[MAXN];
int ver[MAXN];
int nxt[MAXN];
int cnt;
int dep[MAXN];
int lc[MAXN][25];
int lg[MAXN];

inline void add(int x, int y) {
	ver[++cnt] = y;
	nxt[cnt] = head[x];
	head[x] = cnt;
}

inline void init(int n) {
	lg[1] = 0, lg[2] = 1;
	for (int i = 3; i <= n; i++) {
		lg[i] = lg[i / 2] + 1;
	}
}

inline void dfs(int now, int fa) {
	dep[now] = dep[fa] + 1;
	lc[now][0] = fa;
	for (int i = 1; i <= lg[dep[now]] + 1; i++) {
		lc[now][i] = lc[lc[now][i - 1]][i - 1];
	}
	for (int i = head[now]; i; i = nxt[i]) {
		int v = ver[i];
		if (v != fa)
			dfs(v, now);
	}
}

inline int lca(int u, int v) {
	if (dep[u] < dep[v])
		swap(u, v);
	while (dep[u] > dep[v]) {
		u = lc[u][lg[dep[u] - dep[v]]];
	}
	if (u == v)
		return u;
	for (int i = lg[dep[u]]; i >= 0; i--) {
		if (lc[u][i] != lc[v][i]) {
			u = lc[u][i];
			v = lc[v][i];
		}
	}
	return lc[u][0];
}


int main() {
	int n, m, s;
	int u, v;
	scanf("%d %d %d", &n, &m, &s);
	init(n);
	for (int i = 1; i < n; i++) {
		//int u,v;
		scanf("%d %d", &u, &v);
		add(u, v);
		add(v, u);
	}
	dfs(s, 0);
	while (m--) {
		scanf("%d %d", &u, &v);
		printf("%d\n", lca(u, v));
	}
	return 0;
}