Cod sursa(job #3243774)

Utilizator Alex_BerbescuBerbescu Alexandru Alex_Berbescu Data 21 septembrie 2024 09:14:50
Problema Stramosi Scor 100
Compilator cpp-64 Status done
Runda Arhiva de probleme Marime 1.32 kb
#pragma GCC optimize("O3")
#pragma GCC optimize("fast-math")
#pragma GCC optimize("unroll-loops")
#include<bits/stdc++.h>
using namespace std;
ifstream fin("stramosi.in");
ofstream fout("stramosi.out");
const int dim = 250005, dimk = 20;
bool viz[dim];
int tata[dim], in[dim], out[dim], dp[dimk][dim], dpdoi[dim], n, m, p, q, ct;
vector<int>noduri[dim];
void dfs(int nodu)
{
    viz[nodu] = 1;
    in[nodu] = ++ct;;
    for(auto it: noduri[nodu])
    {
        if(!viz[it])
        {
            dpdoi[it] = dpdoi[nodu] + 1;
            dfs(it);
        }
    }
    out[nodu] = ++ct;
}

bool stramos(int a, int b)
{
    return (in[a] <= out[b] && in[b] <= out[a]);
}

int lca(int a, int b) // al b lea stramos al lui a
{
    for(int j = dimk; j >= 0; --j)
    {
        if(b & (1 << j))
        {
            a = dp[j][a];
        }
    }
    return a;
}
int32_t main(int argc, char * argv[])
{
     fin >> n >> m;
     for(int i = 1; i <= n; ++i)
     {
         fin >> tata[i];
         noduri[tata[i]].push_back(i);
         dp[0][i] = tata[i];
     }
     for(int j = 1; j <= dimk; ++j)
     {
         for(int i = 1; i <= n; ++i)
         {
             dp[j][i] = dp[j - 1][dp[j - 1][i]];
         }
     }
     dfs(0);
     for(int j = 1; j <= m; ++j)
     {
         fin >> q >> p;
         fout << lca(q, p) << '\n';
     }
      return 0;
}