Mai intai trebuie sa te autentifici.
Cod sursa(job #3004003)
Utilizator | Data | 16 martie 2023 08:30:21 | |
---|---|---|---|
Problema | Lowest Common Ancestor | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 1.4 kb |
#include <fstream>
#include <vector>
#define maxl 18
#define dim 100001
using namespace std;
ifstream fin("lca.in");
ofstream fout("lca.out");
int crt;
int stramos[maxl][dim], ps[dim], pe[dim], nivel[dim], tata[dim];
vector <int> l[dim];
int n;
void dfs(int nod, int niv)
{
crt++;
nivel[nod]=niv;
ps[nod]=crt;
for(int i=0;i<l[nod].size();i++)
{
dfs(l[nod][i], niv+1);
}
crt++;
pe[nod]=crt;
}
int estramos(int x, int y)
{
return ps[x]<=ps[y]&&pe[y]<=pe[x];
}
void calcstramos()
{
for(int i=1;i<=n;i++)
{
stramos[0][i]=tata[i];
}
for(int p=1;p<maxl;p++)
{
for(int i=1;i<=n;i++)
{
stramos[p][i]=stramos[p-1][stramos[p-1][i]];
}
}
}
int lca(int x, int y)
{
if(estramos(x, y)==1)
{
return x;
}
if(estramos(y, x)==1)
{
return y;
}
int z;
for(int p=maxl-1;p>=0;p--)
{
z=stramos[p][x];
if(z!=0&&estramos(z, y)==0)
{
x=z;
}
}
return stramos[0][x];
}
int main()
{
int q, i, x, y;
fin>>n>>q;
tata[1]=0;
for(i=2;i<=n;i++)
{
fin>>tata[i];
l[tata[i]].push_back(i);
}
dfs(1, 0);
calcstramos();
for(i=1;i<=q;i++)
{
fin>>x>>y;
fout<<lca(x, y)<<"\n";
}
return 0;
}