Pagini recente » Cod sursa (job #1379095) | Cod sursa (job #1555058) | Cod sursa (job #2291057) | Cod sursa (job #1375147) | Cod sursa (job #1867463)
#include <bits/stdc++.h>
using namespace std;
int m, n, q, i, j, k, S[250010][18];
int main()
{
freopen("stramosi.in","r",stdin);
freopen("stramosi.out","w",stdout);
scanf("%d%d",&n,&q);//f >> n >> q;
m = 31-__builtin_clz(n);
for(i = 1; i <= n; i++)
scanf("%d",&S[i][0]);//f >> S[i][0];
for(i = 1; i <= m; i++)
for(j = 1; j <= n; j++)
S[j][i] = S[S[j][i-1]][i-1];
for(;q;q--)
{
scanf("%d%d",&j,&i);//ff>>j>>i;
while(i)
{
k = __builtin_ctz(i);
j = S[j][k];
i -= 1<<k;
}
printf("%d\n",j);//g << j << '\n';
}
return 0;
}