Cod sursa(job #1892430)

Utilizator FlorinHajaFlorin Gabriel Haja FlorinHaja Data 24 februarie 2017 22:46:46
Problema Lowest Common Ancestor Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.95 kb
#include <fstream>
#include <vector>

using namespace std;

ifstream f("lca.in");
ofstream g("lca.out");

const int H = 200;
int n,i,x,y,m,nv[100005],tt[100005],ttm[100005];
bool viz[100005];
vector<int>ls[100005];

void df(int x, int tm, int niv) {
    ttm[x] = tm;
    nv[x] = niv;
    viz[x]=1;
    if (niv%H == 0)
        tm = x;
    for (int i = 0; i<ls[x].size(); i++) {
        if (viz[ls[x][i]] == 0)
            df(ls[x][i],tm,niv+1);
    }
}

int query(int x, int y) {
    while (ttm[x]!=ttm[y]) {
        if (nv[x]>nv[y])
            x = ttm[x];
        else y=ttm[y];

    }
    while (x != y) {
        if (nv[x]>nv[y])
            x = tt[x];
        else y=tt[y];
    }
    return x;
}

int main() {
    f>>n>>m;
    for (i = 2; i <= n; i++) {
        f>>tt[i];
        ls[tt[i]].push_back(i);
    }
    df(1,1,0);
    while (m--) {
        f>>x>>y;
        g<<query(x,y)<<'\n';
    }
    return 0;
}