Cod sursa(job #3318048)

Utilizator Dia3141Costea Diana Stefania Dia3141 Data 26 octombrie 2025 18:23:29
Problema Lowest Common Ancestor Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.94 kb
#include <fstream>
#include <vector>
#define nmax (int)(1e5+1)
using namespace std;
ifstream cin("lca.in");
ofstream cout("lca.out");
int n,q,x,y,k,rmq[nmax][20],st[nmax],dr[nmax];
vector<int>v[nmax];
void dfs(int nod,int dad){
    rmq[nod][0]=dad;
    st[nod]=++k;
    for(auto i:v[nod])
        dfs(i,nod);
    dr[nod]=++k;
}
bool dad(int x,int y){
    return st[x]<=st[y]&&dr[y]<=dr[x];
}
int lca(int x,int y){
    if(dad(x,y))
        return x;
    if(dad(y,x))
        return y;
    for(int i=18;i>=0;i--)
        if(rmq[x][i]!=0&&!dad(rmq[x][i],y))
            x=rmq[x][i];
    return rmq[x][0];
}
signed main()
{
    cin>>n>>q;
    for(int i=2;i<=n;i++){
        cin>>x;
        v[x].push_back(i);
    }
    dfs(1,0);
    for(int i=1;i<=18;i++)
        for(int j=1;j<=n;j++)
            rmq[j][i]=rmq[rmq[j][i-1]][i-1];
    while(q--){
        cin>>x>>y;
        cout<<lca(x,y)<<'\n';
    }
    return 0;
}