Cod sursa(job #2982853)

Utilizator gabriel.9619Gabriel Stefan Tita gabriel.9619 Data 20 februarie 2023 23:46:28
Problema Lowest Common Ancestor Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 1.48 kb
#include <fstream>
#include <vector>
#define dim 100001
#define log 19
using namespace std;
ifstream fin("lca.in");
ofstream fout("lca.out");

vector <int> l[dim];
int stramos[log][dim], tata[dim], ps[dim], pd[dim];
int n, k;

int este_stramos(int x, int y)
{
    if(ps[x]<=ps[y]&&pd[y]<=pd[x])
    {
        return 1;
    }
    return 0;
}

void stramos_build()
{
    int nod, p;
    for(nod=1;nod<=n;nod++)
    {
        stramos[0][nod]=tata[nod];
    }
    for(p=1;p<log;p++)
    {
        for(nod=1;nod<=n;nod++)
        {
            stramos[p][nod]=stramos[p-1][stramos[p-1][nod]];
        }
    }
}

void dfs(int nod)
{
    k++;
    ps[nod]=k;
    for(int i=0;i<l[nod].size();i++)
    {
        if(tata[nod]!=l[nod][i])
        {
            dfs(l[nod][i]);
        }
    }
    k++;
    pd[nod]=k;
}

int lca(int x, int y)
{
    if(este_stramos(x, y)==1)
    {
        return x;
    }
    else
    if(este_stramos(y, x)==1)
    {
        return y;
    }
    for(int p=log-1;p>=0;p--)
    {
        int z=stramos[p][x];
        if(z!=0&&este_stramos(z, y)==0)
        {
            x=z;
        }
    }
    return stramos[0][x];
}

int main()
{
    int m, i, x, y;
    fin>>n>>m;
    for(i=2;i<=n;i++)
    {
        fin>>tata[i];
        l[i].push_back(tata[i]);
        l[tata[i]].push_back(i);
    }
    dfs(1);
    stramos_build();
    for(i=1;i<=m;i++)
    {
        fin>>x>>y;
        fout<<lca(x, y)<<"\n";
    }
}