Pagini recente » Cod sursa (job #274534) | Cod sursa (job #1324667) | Cod sursa (job #2097452) | Cod sursa (job #2986438) | Cod sursa (job #2282204)
#include <bits/stdc++.h>
using namespace std;
ifstream fin("stramosi.in");
ofstream fout("stramosi.out");
const int NMAX = 250000;
int A[20][NMAX + 5], N, M; //Ancestor de ordin 2^i al lui j;
void Precalculare() {
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)
{
while(P) {
int k = log2(P);
Q = A[k][Q];
P -= (1 << k);
}
return Q;
}
int main()
{
fin >> N >> M;
for(int j = 1; j <= N; j++)
fin >> A[0][j];
Precalculare();
while(M--) {
int p, q;
fin >> q >> p;
fout << Ancestor(q, p) << '\n';
}
fin.close();
fout.close();
return 0;
}