Pagini recente » Cod sursa (job #2266546) | Cod sursa (job #651668) | Monitorul de evaluare | Cod sursa (job #1528344) | Cod sursa (job #2882487)
#include<iostream>
#include<fstream>
#include<vector>
using namespace std;
ifstream f("stramosi.in");
ofstream g("stramosi.out");
int n,m;
int LOG;
int up[250005][19];
int x,y;
void Citire()
{
f>>n>>m;
for(int i=1;i<=n;i++)
{
f>>up[i][1];
}
}
void BuildMatrix()
{
for(int i=1;i <= n ;i++)
{
for(int j=2;j<=LOG;j++)
{
up[i][j] = up[up[i][j-1]][j-1];
}
}
for(int i=1;i<=n;i++)
{
for(int j=1;j<=LOG;j++)
cout<<up[i][j] << " ";
cout<<"\n";
}
}
int KthAncestor(int node, int k)
{
for(int i=1;i<=LOG;i++)
{
if(k&(1<<(i-1)))
node = up[node][i];
}
return node;
}
int main()
{
Citire();
while(1<<LOG<=n)
LOG++;
BuildMatrix();
for(int i=1;i<=m;i++)
{
f>>x>>y;
g<<KthAncestor(x,y)<<"\n";
}
}