LCA（最近公共祖先）

tarjan

# include <iostream>
# include <cstdio>
# include <cstring>
# include <string>
# include <cmath>
# include <vector>
# include <map>
# include <queue>
# include <cstdlib>
# define MAXN 500001
using namespace std;

int n, m, s;
int fa[MAXN], qx[MAXN], qy[MAXN], ans[MAXN], f[MAXN];
vector <int> vec[MAXN], q[MAXN];

inline int find(int x)
{
    return x == fa[x] ? x : fa[x] = find(fa[x]);
}

inline void dfs(int u)
{
    int i, v;
    fa[u] = u;
    for(i = 0; i < vec[u].size(); i++)
    {
        v = vec[u][i];
        if(f[u] != v) f[v] = u, dfs(v);
    }
    for(i = 0; i < q[u].size(); i++)
        if(f[v = u ^ qx[q[u][i]] ^ qy[q[u][i]]])//^运算获得与u相连的点（qx，qy中必有一个是u）
            ans[q[u][i]] = find(v);
    fa[u] = f[u];//这里f相当于vis数组
}

int main()
{
    int i, x, y;
    cin>>n>>m>>s;
    for(i = 1; i < n; i++)
    {
        cin>>x>>y;
        vec[x].push_back(y);
        vec[y].push_back(x);
    }
    for(i = 1; i <= m; i++)
    {
        cin>>qx[i]>>qy[i];
        q[qx[i]].push_back(i);
        q[qy[i]].push_back(i);
    }
    dfs(s);
    for(i = 1; i <= m; i++) printf("%d\n", ans[i]);
    return 0;
}
/*
5 5 4
3 1
2 4
5 1
1 4
2 4
3 2
3 5
1 2
4 5
我们要构造：
vec：
1   3 4 5
2   4
3   1
4   1 2
5   1

n: 0 1 2 3 4
qx:2 3 3 1 4
qy:4 2 5 2 5
q:  n
1   3
2   0 1 3
3   1 2
4   0 4
5   2 4

*/