Pagini recente » Cod sursa (job #796491) | Cod sursa (job #1968740) | Cod sursa (job #1049632) | Cod sursa (job #1299438) | Cod sursa (job #622853)
Cod sursa(job #622853)
#include <stdio.h>
#define X 19
#define PUT(a) (1 << a)
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 > PUT(t + 1)) {
++t;
}
Q = v[t][Q];
P -= PUT(t);
}
printf("%ld\n", Q);
}
return 0;
}