Cod sursa(job #954606)

Utilizator deresurobertoFMI - Deresu Roberto deresuroberto Data 29 mai 2013 17:07:35
Problema Lowest Common Ancestor Scor 90
Compilator cpp Status done
Runda Arhiva educationala Marime 0.9 kb
#include<cstdio>
#include<vector>
using namespace std;
int n,m,x,y,l,i,nivel[100007],tata[100007];
vector<int>v[100007];
char s[10000001],c[15];

void dfs(int x,int l,int t)
{
    int j;
    tata[x]=t;
    nivel[x]=l;
    t=x;
    for(j=0;j<v[x].size();j++)dfs(v[x][j],l+1,t);
}

void citire()
{
    freopen("lca.in","r",stdin);
    freopen("lca.out","w",stdout);
    scanf("%d %d\n",&n,&m);
    gets(s);
    for(i=1;i<n;i++){
        x=0;
        while(s[l]!=' ' && s[l])x=x*10+s[l]-'0',l++;
        l++;
        v[x].push_back(i+1);
    }
}

void lca()
{
    gets(c);
    l=0,x=0,y=0;
    while(c[l]!=' ')x=x*10+c[l]-'0',l++;
    l++;
    while(c[l])y=y*10+c[l]-'0',l++;

    while(x!=y)
    if(nivel[x]>nivel[y])x=tata[x];
                    else y=tata[y];
    printf("%d\n",x);
}

int main()
{
    citire();
    dfs(1,0,0);
    for(i=1;i<=m;i++)lca();
    return 0;
}