洛谷P3379题解

树上LCA倍增板子题。

#include <cstdio>
#include <iostream>
using namespace std;

#define MaxN 500005
#define MaxM 500005*2
#define LogN 20

int N, M, S;
int point[MaxN], tot;
int nxt[MaxM], v[MaxM];

int deep[MaxN];
bool flag[MaxN];
int f[MaxN][LogN];

void add(int x, int y){
    ++tot; nxt[tot] = point[x];
    v[tot] = y; point[x] = tot;
}

void DFS(int node, int fa, int d){
    deep[node] = d;
    f[node][0] = fa;
    flag[node] = true;
    for(int i = point[node]; i; i = nxt[i]){
        if(flag[v[i]]) continue;
        DFS(v[i], node, d+1);
    }
}

void process(){
    for(int j = 1; j<LogN; ++j)
        for(int i = 1; i<=N; ++i)
            f[i][j] = f[f[i][j-1]][j-1];
}

int Find_LCA(int x, int y){
    if(deep[x]<deep[y])  swap(x, y);
    for(int j = LogN-1; j>=0; --j){
        if(deep[f[x][j]]>=deep[y]) x = f[x][j];
    }
    if(x == y) return x;
    for(int j = LogN-1; j>=0; --j){
        if(f[x][j]!=f[y][j]){
            x = f[x][j];
            y = f[y][j];
        }
    }
    return f[x][0];
}

int main(){
    scanf("%d %d %d", &N, &M, &S);
    for(int i = 1; i<N; ++i){
        int x, y;
        scanf("%d %d", &x, &y);
        add(x, y);
        add(y, x);
    }
    DFS(S, 0, 1);
    process();
    for(int i = 1; i<=M; ++i){
        int x, y;
        scanf("%d %d", &x, &y);
        printf("%d\n", Find_LCA(x, y));
    }
    return 0;
}