Pagini recente » Cod sursa (job #1454704) | Cod sursa (job #1952120) | Cod sursa (job #192226) | Cod sursa (job #709615) | Cod sursa (job #1976320)
#include <cstdio>
using namespace std;
int d[20][250005];
int main() {
freopen("stramosi.in","r",stdin);
freopen("stramosi.out","w",stdout);
int n, m, i, j, p, q;
scanf("%d%d", &n, &m);
for(i = 1; i <= n; i ++)
scanf("%d", &d[0][i]);
for(j = 1; j <= 17; j ++)
for(i = 1; i <= n; i ++)
d[j][i] = d[j - 1][d[j - 1][i]];
for (i = 1; i <= m; i ++) {
scanf("%d%d", &q, &p);
for (j = 17; j >= 0; j --)
if (p & (1 << j))
q = d[j][q];
printf("%d\n", q);
}
return 0;
}