Pagini recente » Cod sursa (job #1663066) | Cod sursa (job #2273352) | Cod sursa (job #1609623) | Cod sursa (job #1999043) | Cod sursa (job #1061432)
#include <fstream>
using namespace std;
ifstream f("stramosi.in");
ofstream g("stramosi.out");
int Father[20][250005];
int Log2[250005];
int N,M;
void Read()
{
int i;
f>>N>>M;
for(i=1;i<=N;i++)
f>>Father[0][i];
}
void Precalculate()
{
for(int i=1;(1<<i)<=N;i++)
for(int j=1;j<=N;j++)
Father[i][j]=Father[i-1][Father[i-1][j]];
for(int i=2;i<=N;i++)
Log2[i]=Log2[i/2]+1;
}
int Query(int x,int y)
{
while(x)
{
int k=Log2[x];
y=Father[k][y];
x-=(1<<k);
}
return y;
}
void Browse()
{
while(M--)
{
int x,y;
f>>x>>y;
g<<Query(y,x)<<"\n";
}
}
int main()
{
Read();
Precalculate();
Browse();
return 0;
}