LCA倍增模板

题目

n个点，m次询问，s为根节点
求a, b的lca

code（dfs）

#include <algorithm>
#include <cctype>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <deque>
#include <functional>
#include <list>
#include <map>
#include <iomanip>    
#include <iostream>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
const int maxn = 5e5 + 100;
typedef long long ull;

inline int read() {
	int s = 0, w = 1;
	char ch = getchar();
	while (ch < '0' || ch > '9') { if (ch == '-') w = -1; ch = getchar(); }
	while (isdigit(ch)) { s = (s << 1) + (s << 3) + (ch ^ 48); ch = getchar(); }
	return s * w;
}

int n;
int m;
int s;
int num_edge = 0;
int f[maxn][30];
int deep[maxn];
int link[maxn << 1];
struct Edge { int next, to, dis; }edge[maxn << 1];

inline void add(int from, int to, int dis) {
	edge[++num_edge].dis = dis;
	edge[num_edge].to = to;
	edge[num_edge].next = link[from];
	link[from] = num_edge;
}

void dfs(int u, int fa) {
	deep[u] = deep[fa] + 1;
	f[u][0] = fa;
	for (int i = 1; (1 << i) <= deep[u]; ++i)
		f[u][i] = f[f[u][i - 1]][i - 1];
	for (int i = link[u]; i; i = edge[i].next) {
		if (edge[i].to != fa) dfs(edge[i].to, u);
	}
}

int lca(int x, int y) {
	if (deep[x] < deep[y]) swap(x, y);
	for (int i = 0; i < 20; ++i) {
		if ((deep[x] - deep[y]) & (1 << i)) {
			x = f[x][i];
		}
	}
	if (x == y) return x;
	for (int i = 19; i >= 0; --i) {
		if (f[x][i] != f[y][i]) {
			x = f[x][i];
			y = f[y][i];
		}
	}
	return f[x][0];
}

int main() {
	n = read(), m = read(), s = read();
	for (int i = 1; i < n; ++i) {
		int a, b;
		a = read(), b = read();
		add(a, b, 1);
		add(b, a, 1);
	}
	dfs(s, 0);
	for (int i = 1; i <= m; ++i) {
		int a, b;
		a = read(), b = read();
		printf("%d\n", lca(a, b));
	}
	return 0;
}

code（bfs）

#include <bits/stdc++.h> 
using namespace std; 
const double eps = 1e-8; 
const int maxn = 5e5 + 100; 

template <typename T> 
inline void read(T &s) {
    s = 0; 
    T w = 1, ch = getchar(); 
    while (!isdigit(ch)) { if (ch == '-') w = -10; ch = getchar(); }
    while (isdigit(ch)) { s = (s << 1) + (s << 3) + (ch ^ 48); ch = getchar(); }
    s *= w; 
}

int n, m, s, tot; 
int lin[maxn], dep[maxn], fa[maxn][20]; 
bool vis[maxn]; 
struct node {
    int next, to; 
} edge[maxn << 1]; 

inline void add(int from, int to) {
    edge[++tot].to = to; 
    edge[tot].next = lin[from]; 
    lin[from] = tot; 
}

void bfs() {
    queue <int> q; 
    dep[s] = 1; 
    q.push(s); 
    vis[s] = true; 
    while (!q.empty()) {
        int u = q.front(); 
        q.pop(); 
        for (int i = lin[u]; i; i = edge[i].next) {
            int v = edge[i].to; 
            if (!vis[v]) {			
                dep[v] = dep[u] + 1; 
                fa[v][0] = u; 
                for (int j = 1; j < 20; ++j) 
                    fa[v][j] = fa[fa[v][j - 1]][j - 1]; 
                vis[v] = true; 
                q.push(v); 
            }
        }
    }
}

int lca(int x, int y) {
    if (dep[x] < dep[y]) x ^= y ^= x ^= y; 
    for (int i = 19; i >= 0; --i) {
        if (dep[fa[x][i]] >= dep[y])
            x = fa[x][i]; 
    }
    if (x == y) return x; 
    for (int i = 19; i >= 0; --i) 
        if (fa[x][i] != fa[y][i])
            x = fa[x][i], y = fa[y][i]; 
    return fa[x][0]; 
}

int main() {
    read(n), read(m), read(s); 
    for (int i = 1; i < n; ++i) {
        int x, y; 
        read(x), read(y); 
        add(x, y); 
        add(y, x); 
    }
    bfs(); 
    for (int i = 1; i <= m; ++i) {
        int x, y; 
        read(x), read(y); 
        printf("%d\n", lca(x, y)); 
    }
 	return 0; 
}