Pagini recente » Cod sursa (job #2728417) | Cod sursa (job #2553850) | Cod sursa (job #789368) | Cod sursa (job #2935734) | Cod sursa (job #813373)
Cod sursa(job #813373)
#include <stdio.h>
#include <math.h>
#define X 19
long i, j, n, m, s, t, Q, P, v[X][250000];
int main() {
freopen("stramosi.in", "r", stdin);
freopen("stramosi.out", "w", stdout);
scanf("%ld %ld", &n, &m);
for(i = 1; i <= n; ++i) scanf("%ld", &v[0][i]);
for (i = 1; i < X; ++i)
for (j = 1; j <= n; ++j) {
v[i][j] = v[i - 1][v[i - 1][j]];
}
for (i = 1; i <= m; ++i) {
scanf("%ld %ld", &Q, &P);
while (P && Q) {
t = 0;
while (P > (1 << (t + 1))) {
++t;
}
Q = v[t][Q];
P -= 1 << t;
}
printf("%ld\n", Q);
}
return 0;
}