Cod sursa(job #1517480)

Utilizator patrutoiuandreipatrutoiu andrei patrutoiuandrei Data 4 noiembrie 2015 13:15:24
Problema Lowest Common Ancestor Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.91 kb
#include <fstream>
#include <vector>

#define DIM 100003
#define pb push_back
using namespace std;
ifstream fin("lca.in");
ofstream fout("lca.out");
int rmq[20][2*DIM],nr,i,x,n,m,p[DIM],lg[2*DIM],d,y,j;
vector <int> G[DIM];
void dfs(int x)
{
    rmq[0][++nr]=x;
    if(!p[x])
        p[x]=nr;
    for(size_t i=0;i<G[x].size();i++)
    {
        dfs(G[x][i]);
        rmq[0][++nr]=x;
    }
}
int main()
{
    fin>>n>>m;
    for(i=2;i<=n;i++)
    {
        fin>>x;
        G[x].pb(i);
    }
    dfs(1);
    lg[1]=0;
    for(i=2;i<=nr;i++)
        lg[i]=lg[i/2]+1;
    for(i=1;(1<<i)<=nr;i++)
        for(j=1;j<=nr;j++)
             rmq[i][j]=min(rmq[i-1][j],rmq[i-1][j+(1<<(i-1))]);
    for(i=1;i<=m;i++)
    {
        fin>>x>>y;
        if(p[x]>p[y])
            swap(x,y);
        d=lg[p[y]-p[x]];
        fout<<min(rmq[d][p[x]],rmq[d][p[y]-(1<<d)+1])<<'\n';
    }
    return 0;
}