Pagini recente » Cod sursa (job #2296041) | Cod sursa (job #398802) | Cod sursa (job #1545541) | Cod sursa (job #3227247) | Cod sursa (job #2503225)
#include <cstdio>
#define NMAX 250000
using namespace std;
int n, q, dp[NMAX+10][20];
int main()
{
freopen("stramosi.in", "r", stdin);
freopen("stramosi.out", "w", stdout);
scanf("%d%d", &n, &q);
for(int i=1; i<=n; i++) scanf("%d", &dp[i][0]);
for(int i=1; i<=18; i++)
for(int j=1; j<=n; j++) dp[j][i] = dp[dp[j][i-1]][i-1];
while(q--)
{ int nod, dist, sol;
scanf("%d%d", &nod, &dist);
sol = nod;
for(int i=0; i<=18 && dist; i++) if((dist & (1 << i))) dist = dist ^ (1 << i), sol = dp[sol][i];
printf("%d\n", sol);
}
return 0;
}