C - Simple path(AtCoder Beginner Contest 270)

求树上x->y的路径

思路：先做lca，两个ans同时保存路径点，对第二个ans反转一下输出即可。这里没有必要使用倍增方法去做lca，直接暴力即可

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

#define x first
#define y second
#define endl '\n'
#define rep(i,a,n) for (int i = a; i < n; i ++ )
#define repn(i,a,n) for (int i = a; i <= n; i ++ )
#define pb push_back
#define IOS ios::sync_with_stdio(false); cin.tie(0);cout.tie(0);
typedef long long ll;
#define all(x) (x).begin(),(x).end()
typedef pair<int,int> PII;

ll gcd(ll a,ll b) { return b ? gcd(b,a % b) : a; }
const int mod = 1e9+7;
int n, x, y;
const int N = 200010, M = N * 2;
int h[N], e[M], ne[M], idx;
int depth[N], fa[N];

void dfs(int u, int father)
{
    depth[u] = depth[father] + 1;
    fa[u] = father;
    for (int i = h[u]; ~i; i = ne[i])
    {
        int j = e[i];
        if(j == father) continue;
        dfs(j, u);
    }
}

void add(int a, int b)
{
    e[idx] = b, ne[idx] = h[a], h[a] = idx ++;
}

int main()
{
    IOS;
    cin >> n >> x >> y;
    memset(h, -1, sizeof h);
    for (int i = 1; i < n; i ++ )
    {
        int a, b;   cin >> a >> b;
        add(a, b), add(b, a);
    }
    dfs(1, 0);
    vector<int> ans1, ans2;
    int a = x, b = y;
    while(a != b)   
    {
        if(depth[a] > depth[b]) ans1.push_back(a), a = fa[a];
        else    ans2.push_back(b), b = fa[b];
    }
    reverse(all(ans2));
    for (auto it : ans1)    cout << it << ' ';
    cout << a << ' ';
    for (auto it : ans2)    cout << it << ' ';
    
    return 0;
}