Pagini recente » Cod sursa (job #1197971) | Cod sursa (job #187199) | Cod sursa (job #2911622) | Cod sursa (job #1491592) | Cod sursa (job #2503027)
#include <cstdio>
#include <cmath>
using namespace std;
int strm[250005][20], v[19], rng[250000];
int main()
{
freopen("stramosi.in","r",stdin);
freopen("stramosi.out","w",stdout);
int n, m, i, j, k, p, q, maxx;
scanf("%d%d",&n,&m);
for (i=1; i<=n; i++)
scanf("%d", &strm[i][0]);
for (j=1; j<=log2(n); j++)
{
for (i=1; i<=n; i++)
strm[i][j]=strm[strm[i][j-1]][j-1];
}
for (i=1; i<=m; i++)
{
scanf("%d%d", &p, &q);
for (j=0; j<=18; j++)
{
v[j]=(q&1);
q=(q>>1);
if (v[j]!=0)
maxx=j;
if (q==0)
break;
}
for (j=maxx+1; j--; j>=0)
{
if (v[j]==1)
p=strm[p][j];
if (p==0)
break;
}
printf("%d\n",p);
}
return 0;
}