Cod sursa(job #2241118)

Utilizator AvramDanielAvram Daniel AvramDaniel Data 14 septembrie 2018 20:56:27
Problema Lowest Common Ancestor Scor 10
Compilator cpp Status done
Runda Arhiva educationala Marime 1.34 kb
#include <bits/stdc++.h>
using namespace std;
#define N 500010
int n,m,a,poz[N],x,y,l,k,pozy,pozx,lg[N],rmq[21][N];
bool viz[N];
vector<int>v[N],eu,level;

int meen(int x,int y)
{
    if(level[poz[x]]>level[poz[y]]) return y;
    return x;
}

void euler(int x,int lev)
{
    if(!viz[x])
    {
        viz[x]=1;
        poz[x]=eu.size()+1;
    }
    eu.push_back(x);
    level.push_back(lev);
    for(int i=0;i<v[x].size();i++)
    {
        euler(v[x][i],lev+1);
        eu.push_back(x);
        level.push_back(lev);
    }
    return;
}

int main()
{
    ifstream cin("lca.in");
    ofstream cout("lca.out");
    cin>>n>>m;
    lg[1]=0;
    for(int i=2;i<=n;i++)
    {
        cin>>a;
        v[a].push_back(i);
        lg[i]=lg[i/2]+1;
    }
    euler(1,0);

    for(int i=0;i<eu.size();i++)
    {
        rmq[0][i+1]=eu[i];
    }
    n=eu.size();
    for(int i=1;(1<<i)<=n;i++)
    {
        for(int j=1;j<=n-(1<<i)+1;j++)
        {
            rmq[i][j]=meen(rmq[i-1][j],rmq[i-1][j+(1<<(i-1))]);
        }
    }
    for(;m;m--)
    {
        cin>>x>>y;
        pozx=min(poz[x],poz[y]);
        pozy=max(poz[x],poz[y]);
        l=pozy-pozx+1;
        k=lg[l];
        //cout<<k<<' '<<pozx<<' '<<pozy<<'\n';
        cout<<meen(rmq[k][pozx],rmq[k][pozy-(1<<(k))+1])<<'\n';

    }

    return 0;
}