Cod sursa(job #3277417)

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

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

int adan[100001];
int bl[100001];
vector<int> v[100001];
int tata[100001];
int n;

void dfs(int nod,int a,int adan1){
    adan[nod]=adan1;
    bl[nod]=a;
    if(adan1%300==0) a=nod;
    for(auto it:v[nod]){
        dfs(it,a,adan1+1);
    }
}

int lca(int a,int b){
    while(bl[a]!=bl[b]){
        if(adan[a]>adan[b]) a=bl[a];
        else b=bl[b];
    }
    while(a!=b){
        if(adan[a]>adan[b]) a=tata[a];
        else b=tata[b];
    }
    return a;
}


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

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