Cod sursa(job #3277238)

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

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

int cnt,n;
int st[100001];
int dr[100001];
vector<int> v[100001];

int lca(int a,int b){
    int ci=1,i;
    for(i=2;i<=n;i++){
        if(st[i]<=min(st[a],st[b]) && max(dr[a],dr[b])<=dr[i] && st[i]>st[ci]){
            ci=i;
        }
    }
    return ci;
}

void dfs(int tata,int nod){
    st[nod]=cnt;cnt++;
    for(auto it:v[nod]){
        if(it==tata) continue;
        dfs(nod,it);
    }
    dr[nod]=cnt;cnt++;
}

int main()
{
    int i,a,b,m;
    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<=m;i++){
        cin>>a>>b;
        cout<<lca(a,b)<<"\n";
    }
    return 0;
}