Cod sursa(job #2924131)
Utilizator | Vasile George Fernando123 | Data | 26 septembrie 2022 09:23:39 |
---|---|---|---|
Problema | Lowest Common Ancestor | Scor | 10 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.5 kb |
#include <fstream>
using namespace std;
ifstream cin("lca.in");
ofstream cout("lca.out");
int n, m, tata[1005], viz[101], x, y;
int lca(int x, int y)
{
for(int i=1;i<=n;i++)
viz[i]=0;
viz[x]=1;
while(x!=1)
{
x=tata[x-1];
viz[x]=1;
}
while(viz[y]!=1)
y=tata[y-1];
return y;
}
int main()
{
cin>>n>>m;
for(int i=1;i<=n-1;i++)
cin>>tata[i];
for(int i=1;i<=m;i++)
{
cin>>x>>y;
cout<<lca(x, y)<<'\n';
}
return 0;
}