Cod sursa(job #2203729)

Utilizator Vlad_lsc2008Lungu Vlad Vlad_lsc2008 Data 12 mai 2018 23:25:09
Problema Lowest Common Ancestor Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 1.56 kb
#include <iostream>
#include <fstream>
#include <vector>
using namespace std;

int n,m1,nr;
vector<int> m[100010];
int nivel[200010];
int noduri[200010];
int poz[200010];
int put[25];
int lg[200010];
int rmq[200010][23];

void liniarize(int nod,int level)
{
    noduri[++nr]=nod; nivel[nr]=level;
    if(poz[nod]==0) poz[nod]=nr;
    for(vector<int>::iterator it=m[nod].begin();it!=m[nod].end();it++)
    {
        liniarize(*it,level+1);
        noduri[++nr]=nod; nivel[nr]=level;
    }
}

int min1(int a,int b)
{
    if( nivel[a]<=nivel[b]) return a;
    else return b;
}

int main()
{
    int a,i,j;
    ifstream t1("lca.in");
    ofstream t2("lca.out");
    t1>>n>>m1;
    for(i=1;i<=n-1;i++)
    {
        t1>>a;
        m[a].push_back(i+1);
    }

    liniarize(1,0);
    put[0]=1;
    for(i=1;i<=20;i++) put[i]=2*put[i-1];
    for(i=2;i<=nr;i++) lg[i]=lg[i/2]+1;

    for(i=1;i<=nr;i++) rmq[i][0]=i;
    for(j=1;put[j]<=nr;j++)
        for(i=1; i + put[j] -1 <=nr; i++)
            rmq[i][j] = min1( rmq[i][j-1] , rmq[i+put[j-1]][j-1]);

    int b,l,aux;
    for(i=1;i<=m1;i++)
    {
        t1>>a>>b;
       // cout<<a<<' '<<b<<' '<<poz[a]<<' '<<poz[b]<<'\n';
        a=poz[a];
        b=poz[b];
        if(a>b)
        {
            aux=a;
            a=b;
            b=aux;
        }
        l=lg[b-a+1];
       // cout<<l<<'\n';
       // cout<<rmq[a][l]<<' '<<rmq[ b -put[l]+1][l]<<'\n';
        t2<<noduri[ min1( rmq[a][l], rmq[ b- put[l] +1 ][l]) ]<<'\n';
    }

    t1.close();
    t2.close();
    return 0;
}