Cod sursa(job #3040697)

Utilizator Zed1YasuoAlex Birsan Zed1Yasuo Data 30 martie 2023 12:03:57
Problema Lowest Common Ancestor Scor 100
Compilator cpp-64 Status done
Runda tot_2 Marime 1.22 kb
#include <fstream>
#include <vector>
#include <cmath>
using namespace std;
ifstream f("lca.in");
ofstream g("lca.out");
int n,m;
const int N=1e5+5;
int eu[2*N];
int rmq[20][2*N];
vector<int>a[N];
int niv[N],nr,x,ap[N];
void dfs(int nod,int tt)
{
    niv[nod]=niv[tt]+1;
    eu[++nr]=nod;
    ap[nod]=nr;
    for(auto x : a[nod])
    {
        dfs(x,nod);
        eu[++nr]=nod;
    }
}
int calc(int x,int y)
{
    if(niv[x]<niv[y])
        return x;
    else
        return y;
}
void build_rmq()
{
    int r=nr;
    for(int i=1;i<=r;i++)
        rmq[0][i]=eu[i];
    for(int p=1;(1<<p)<=r;p++)
    {
        int x=(1<<p);
        for(int i=1;i<=r-x;i++)
        {
            rmq[p][i]=calc(rmq[p-1][i],rmq[p-1][i+x/2]);
         //   g<<rmq[p][i]<< " ";
        }
    }
}
int main()
{
    f>>n>>m;
    for(int i=2;i<=n;i++)
    {
        f>>x;
        a[x].push_back(i);
    }
    dfs(1,0);
    build_rmq();
    for(int i=1;i<=m;i++)
    {
        int y;
        f>>x>>y;
        int lft=ap[x];
        int rgt=ap[y];
        if(lft>rgt)
            swap(lft,rgt);
        int LG=log2(rgt-lft+1);
        g<<calc(rmq[LG][lft],rmq[LG][rgt-(1<<LG)+1])<<'\n';
    }
    return 0;
}