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

博客

#include<iostream>
#include<cstring>
#include<cstdio>
#include<queue>
#include<cstdlib>
#include<cmath>
#include<stack>
#include<map>
#include<vector>
#include<algorithm>
using namespace std;
#define ll long long
#define lb long double
#define INF 0x3f3f3f3f
const int maxn = 500035;
const int maxm = 100;
const int mod = 1e6 + 7;
int lg[maxn], head[maxn], dep[maxn], fa[maxn][maxm];
int n, m, s, cnt;
struct node{
    int to;
    int next;
}edge[maxn << 1];
void add(int u, int v){
    edge[cnt].to = v;
    edge[cnt].next = head[u];
    head[u] = cnt ++;
}
void dfs(int s, int f){
    dep[s] = dep[f] + 1;
    fa[s][0] = f;
    for(int i = 1 ; (1 << i) <= dep[s] ; ++ i)
        fa[s][i] = fa[fa[s][i-1]][i-1];
    for(int i = head[s] ; i != -1 ; i = edge[i].next){
        int tt = edge[i].to;
        if(tt != f){
            dfs(tt, s);
        }
    }
}
int lca(int x, int y){
    if(dep[x] < dep[y]) swap(x, y);
    while(dep[x] > dep[y]) x = fa[x][lg[dep[x] - dep[y]] - 1];
    if(x == y) return x;
    for(int i = lg[dep[x]] - 1 ; i >= 0 ; -- i){
        if(fa[x][i] != fa[y][i]){
            x = fa[x][i]; y = fa[y][i];
        }
    }
    return fa[x][0];
}
int main()
{
    int u, v;
    scanf("%d %d %d", &n, &m, &s);
    for(int i = 1 ; i <= n ; ++ i) head[i] = -1;
    for(int i = 1 ; i <= n - 1 ; ++ i){
        scanf("%d %d", &u, &v);
        add(u, v); add(v, u);
    }
    dfs(s, 0);
    for(int i = 1 ; i <= n ; ++ i){
        lg[i] = lg[i-1] + (1 << lg[i-1] == i);
    }
    int x, y;
    for(int i = 1 ; i <= m ; ++ i){
        scanf("%d %d", &x, &y);
        printf("%d\n", lca(x, y));
    }
    return 0;
}