Pagini recente » Cod sursa (job #1294308) | Cod sursa (job #3229656) | Cod sursa (job #3250252) | Cod sursa (job #2163674) | Cod sursa (job #1288839)
#include <cstdio>
using namespace std;
const int NMAX = 250010;
int N, M, Ancestor[19][NMAX], P, Q;
int main()
{
freopen("stramosi.in", "r", stdin);
freopen("stramosi.out", "w", stdout);
scanf("%i %i", &N, &M);
for(int i = 1; i <= N; ++ i) scanf("%i", &Ancestor[0][i]);
for(int i = 1; (1 << i) <= N; ++ i)
for(int j = 1; j <= N; ++ j)
Ancestor[i][j] = Ancestor[i - 1][Ancestor[i - 1][j]];
for(; M; M --)
{
scanf("%i %i", &Q, &P);
for(int i = 0; i <= 18; ++ i)
if(P & (1 << i))
Q = Ancestor[i][Q];
printf("%i\n", Q);
}
}