Cod sursa(job #3277402)

Utilizator PetruApostolApostol Mihnea Petru PetruApostol Data 15 februarie 2025 22:56:11
Problema Lowest Common Ancestor Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 1.08 kb
#include <fstream>
#include <vector>
using namespace std;

ifstream cin("lca.in");
ofstream cout("lca.out");

int cnt,n;
int adan[100001];
int bl[100001][25];
vector<int> v[100001];

int lca(int a,int b){
    int i;
    if(adan[a]>adan[b]) swap(a,b);
    for(i=24;i>=0;i--){
        if(adan[bl[b][i]]>=adan[a]){
            b=bl[b][i];
        }
    }
    if(a==b) return a;
    for(i=24;i>=0;i--){
        if(bl[a][i]!=bl[b][i]){
            a=bl[a][i];
            b=bl[b][i];
        }
    }
    return bl[a][0];
}

void dfs(int tata,int nod){

    bl[nod][0]=tata;
    for(auto it:v[nod]){
        if(it==tata) continue;
        adan[it]=adan[nod]+1;
        dfs(nod,it);
    }
}

int main()
{
    int i,a,b,m,j;
    cin>>n>>m;
    for(i=2;i<=n;i++){
        cin>>a;
        v[i].push_back(a);
        v[a].push_back(i);
    }

    dfs(1,1);
    for(i=1;i<=24;i++){
        for(j=1;j<=n;j++){
            bl[j][i]=bl[bl[j][i-1]][i-1];
        }
    }
    for(i=1;i<=m;i++){
        cin>>a>>b;
        cout<<lca(a,b)<<"\n";
    }
    return 0;
}