【模板】最近公共祖先 lca

最新推荐文章于 2025-04-27 22:06:07 发布

KatzzZZ017

最新推荐文章于 2025-04-27 22:06:07 发布

阅读量184

点赞数 3

CC 4.0 BY-SA版权

文章标签： c++ 算法

本文链接：https://blog.csdn.net/KatzzZZ/article/details/146945520

题面

#include<bits/stdc++.h>
using namespace std;
#define int long long
#define ull unsigned long long
#define PII pair<int,int>
#define endl '\n'
#define N 1000010
const int mod = 1e9 + 7;
const int P = 998244353;
const int INF = 0x3f3f3f3f;
const int Hash = 911;

void solve() {
    int n, m, s;
    cin >> n >> m >> s;
    int mx = 0;
    vector g(n+1, vector<int>());
    for (int i = 1; i < n; i++) {
        int u, v;
        cin >> u >> v;
        g[u].push_back(v);
        g[v].push_back(u);
    }
    vector<int> dep(n+1, 0);
    vector f(n+1, vector<int>(30, 0));
    auto dfs = [&](auto&&self, int x, int fa) -> void {
        dep[x] = dep[fa] + 1;
        mx = max(mx, dep[x]);
        f[x][0] = fa;
        for (int i = 1; i <= 19; i++) {
            f[x][i] = f[f[x][i - 1]][i - 1];
        }
        for (auto i : g[x]) {
            if (i == fa) continue;
            self(self, i, x);
        }
    };
    dfs(dfs, s, s);
    auto lca = [&](int x, int y) -> int {
        if (dep[x] < dep[y]) swap(x, y);
        for (int i = 19; i >= 0; i--) {
            if (dep[x] - (1 << i) >= dep[y]) {
                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];
    };
    while (m--) {
        int a, b;
        cin >> a >> b;
        cout << lca(a, b) << endl;
    }
}

signed main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr); cout.tie(nullptr);

    int T = 1;
    // cin >> T;
    while (T--) {
        solve();
    }
    return 0;
}