Pagini recente » Cod sursa (job #2835823) | Cod sursa (job #1930511) | Cod sursa (job #1760859) | Cod sursa (job #2822078) | Cod sursa (job #1809270)
#include <fstream>
using namespace std;
ifstream fin("stramosi.in");
ofstream fout("stramosi.out");
const int NMax = 250005;
int N,M,TT[NMax];
int A[20][NMax],Log[NMax];
void Read()
{
fin>>N>>M;
for(int i = 1; i <= N; ++i)
fin>>TT[i];
}
void Precalculate()
{
for(int i = 2; i <= N; ++i)
Log[i] = Log[i/2] + 1;
for(int i = 1; i <= N; ++i)
A[0][i] = TT[i];
for(int i = 1; (1<<i) <= N; ++i)
for(int j = 1; j <= N; ++j)
A[i][j] = A[i-1][A[i-1][j]];
}
int Ancestor(int Q, int P)
{
int K;
while(P)
{
K = Log[P];
Q = A[K][Q];
P = P - (1<<K);
}
return Q;
}
void SolveandPrint()
{
while(M--)
{
int Q,P;
fin>>Q>>P;
fout<<Ancestor(Q,P)<<"\n";
}
}
int main()
{
Read();
Precalculate();
SolveandPrint();
return 0;
}