LCA Tarjan 模板 洛谷 P3379

https://www.luogu.com.cn/problem/P3379

#include <bits/stdc++.h>
using namespace std;

const int MAXV  = 5e5 + 5;
const int MAXQ = 5e5 + 5;

int F[MAXV];
bool vis[MAXV];
int ans[MAXQ];

struct Edge {
        int to, nxt;
}edge[MAXV << 1];

int tol1;
int he[MAXV];
void addedge(int u, int v) {
        ++tol1;
        edge[tol1].to = v; edge[tol1].nxt = he[u];
        he[u] = tol1;
}

struct Query {
        int to, nxt;
        int id;
}query[MAXQ << 1];
int tol2;
int hq[MAXQ];
void addquery(int u, int v, int id) {
        ++tol2;
        query[tol2].to = v; query[tol2].nxt = hq[u]; query[tol2].id = id;
        hq[u] = tol2;
}

void init() {
        tol1 = tol2 = 0;
        memset(F, -1, sizeof F);
        memset(he, -1, sizeof he);
        memset(hq, -1, sizeof hq);
        memset(vis, false, sizeof vis);
}

int Find(int x) {
        if (F[x] == -1)
                return x;
        return F[x] = Find(F[x]);
}

void LCA(int u, int pu) {
        for (int i = he[u]; i != -1; i = edge[i].nxt) {
                int v = edge[i].to;
                if (pu == v)
                        continue;
                LCA(v, u);
                F[v] = u;
        }

        for (int i = hq[u]; i != -1; i = query[i].nxt) {
                if (vis[query[i].to]){
                        ans[query[i].id] = Find(query[i].to);
                }
        }
        vis[u] = true;
}
int main() {
        init();
        int n, m, s;
        scanf("%d%d%d", &n, &m, &s);
        for (int i = 1; i < n; ++i) {
                int u, v;
                scanf("%d%d", &u, &v);
                addedge(u, v);
                addedge(v, u);
        }

        for (int i = 0; i < m; ++i) {
                int u, v;
                scanf("%d%d", &u, &v);
                addquery(u, v, i);
                addquery(v, u, i);
        }
        LCA(s, -1);
        for (int i = 0; i < m; ++i)
                printf("%d\n", ans[i]);
        return 0;
}

// kuangbin写法，处理细节更加到位一些，上一种更加好理解一些可以解决LCA(u, u) = u这种特殊情况
#include <bits/stdc++.h>
using namespace std;

const int MAXV  = 5e5 + 5;
const int MAXQ = 5e5 + 5;

int F[MAXV];
bool vis[MAXV];
int ans[MAXQ];

struct Edge {
        int to, nxt;
}edge[MAXV << 1];

int tol1;
int he[MAXV];
void addedge(int u, int v) {
        ++tol1;
        edge[tol1].to = v; edge[tol1].nxt = he[u];
        he[u] = tol1;
}

struct Query {
        int to, nxt;
        int id;
}query[MAXQ << 1];
int tol2;
int hq[MAXQ];
void addquery(int u, int v, int id) {
        ++tol2;
        query[tol2].to = v; query[tol2].nxt = hq[u]; query[tol2].id = id;
        hq[u] = tol2;
}

void init() {
        tol1 = tol2 = 0;
        memset(F, -1, sizeof F);
        memset(he, -1, sizeof he);
        memset(hq, -1, sizeof hq);
        memset(vis, false, sizeof vis);
}

int Find(int x) {
        if (F[x] == -1)
                return x;
        return F[x] = Find(F[x]);
}

int ancestor[MAXQ];
void LCA(int u) {
        ancestor[u] = u;
        vis[u] = true;
        for (int i = he[u]; i != -1; i = edge[i].nxt) {
                int v = edge[i].to;
                if (vis[v]) continue;
                LCA(v);
                F[Find(v)] = u;
                ancestor[Find(v)] = u;
        }

        for (int i = hq[u]; i != -1; i = query[i].nxt) {
                int v = query[i].to;
                if (vis[v]){
                        ans[query[i].id] = ancestor[Find(v)];
                }
        }
}

int main() {
        init();
        int n, m, s;
        scanf("%d%d%d", &n, &m, &s);
        for (int i = 1; i < n; ++i) {
                int u, v;
                scanf("%d%d", &u, &v);
                addedge(u, v);
                addedge(v, u);
        }

        for (int i = 0; i < m; ++i) {
                int u, v;
                scanf("%d%d", &u, &v);
                addquery(u, v, i);
                addquery(v, u, i);
        }
        LCA(s);
        for (int i = 0; i < m; ++i)
                printf("%d\n", ans[i]);
        return 0;
}