Cod sursa(job #3216328)

Utilizator Chris_BlackBlaga Cristian Chris_Black Data 15 martie 2024 21:26:02
Problema Lowest Common Ancestor Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 1.38 kb
#include <bits/stdc++.h>
#define pii pair<int, int>
#define ff first
#define ss second
#define vi vector<int>
#define vvi vector<vi>
#define pb push_back
#define vpi vector<pii>
#define vvpi vector<vpi>
#define pb push_back
#define eb emplace_back

using namespace std;
const string TASK("lca");
ifstream fin(TASK + ".in");
ofstream fout(TASK + ".out");
#define cin fin
#define cout fout

const int N = 1e5 + 9, LG = 19;

int n, m, t[N][LG], dep[N];
vvi G(N);

void Dfs(int x = 1)
{
    for(int i = 1; i < LG; ++i)
        t[x][i] = t[t[x][i - 1]][i - 1];

    for(auto y : G[x])
    {
        dep[y] = dep[x] + 1;
        Dfs(y);
    }
}


int get_lca(int x, int y)
{
    if(dep[x] < dep[y])swap(x, y);

    for(int i = LG - 1; i >= 0; --i)
        if(dep[x] - (1 << i) >= dep[y])
            x = t[x][i];

    if(x == y)return x;

    for(int i = LG - 1; i >= 0; --i)
        if(t[x][i] != t[y][i])
        {
            x = t[x][i];
            y = t[y][i];
        }

    return t[x][0];
}

int main()
{
    ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);

    cin >> n >> m;

    for(int i = 2; i <= n; ++i)
    {
        cin >> t[i][0];
        G[t[i][0]].pb(i);
    }

    Dfs();

    int x, y;
    for(int i = 1; i <= m; ++i)
    {
        cin >> x >> y;
        cout << get_lca(x, y) << '\n';
    }
    return 0;
}