Cod sursa(job #3201467)

Utilizator rapidu36Victor Manz rapidu36 Data 8 februarie 2024 14:46:29
Problema Lowest Common Ancestor Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 1.3 kb
#include <fstream>
#include <vector>

using namespace std;

const int N = 1e5;
const int L = 17;

int s[L][N+1], t_in[N+1], t_out[N+1], timp_c;
vector <int> fii[N+1];

void dfs(int x)
{
    t_in[x] = ++timp_c;
    for (auto y: fii[x])
    {
        dfs(y);
    }
    t_out[x] = ++timp_c;
}

bool este_stramos(int x, int y)
{
    return (t_in[x] <= t_in[y] && t_out[y] <= t_out[x]);
}

int lca(int x, int y)
{
    if (este_stramos(x, y))
    {
        return x;
    }
    int sc = x, i = L - 1;
    while (i >= 0)
    {
        int stramos = s[i][sc];
        if (stramos != 0 && !este_stramos(stramos, y))
        {
            sc = s[i][sc];
        }
        i--;
    }
    return s[0][sc];
}

int main()
{
    ifstream in("lca.in");
    ofstream out("lca.out");
    int n, nq;
    in >> n >> nq;
    for (int j = 2; j <= n; j++)
    {
        int t;
        in >> t;
        s[0][j] = t;
        fii[t].push_back(j);
    }
    for (int i = 1; (1 << i) <= n; i++)
    {
        for (int j = 1; j <= n; j++)
        {
            s[i][j] = s[i-1][s[i-1][j]];
        }
    }
    dfs(1);
    for (int i = 0; i < nq; i++)
    {
        int x, y;
        in >> x >> y;
        out << lca(x, y) << "\n";
    }
    in.close();
    out.close();
    return 0;
}