Cod sursa(job #2125175)

Utilizator andreigeorge08Sandu Ciorba andreigeorge08 Data 8 februarie 2018 08:22:08
Problema Lowest Common Ancestor Scor 90
Compilator cpp Status done
Runda Arhiva educationala Marime 0.97 kb
#include <bits/stdc++.h>
using namespace std;

ofstream fout("lca.out");
int tata[100005], n, m, nivel[100005], viz[100005];
vector <int>L[100005];

void DFS(int nod)
{
    viz[nod] = 1;
    for(auto i : L[nod])
        if(!viz[i]){
            nivel[i] = nivel[nod] + 1;
            DFS(i);
        }
}

int lca(int x, int y)
{
    while(nivel[x] > nivel[y])
        x = tata[x];

    while(nivel[y] > nivel[x])
        y = tata[y];

    while(x != y)
        x = tata[x],
        y = tata[y];

    return x;
}
void Citire()
{
    int x, y;
    FILE * fin = freopen("lca.in", "r", stdin);

    fscanf(fin, "%d %d", &n, &m);

    for(int i = 2; i <= n; i++)
    {
        fscanf(fin, "%d", &tata[i]);
        L[tata[i]].push_back(i);
    }

    nivel[1] = 1;
    DFS(1);

    while(m--)
    {
        fscanf(fin, "%d %d", &x, &y);
        fout << lca(x, y) << "\n";
    }
    fclose(fin);

}
int main()
{
    Citire();
    return 0;
}