Pagini recente » Borderou de evaluare (job #2783256) | Cod sursa (job #1779500) | Cod sursa (job #2664349) | Cod sursa (job #2459444) | Cod sursa (job #198437)
Cod sursa(job #198437)
#include <stdio.h>
#define MAXN 250005
#define MAXL 18
int os[MAXN][MAXL+1];
int main(void)
{
int n,m,i,j,p,q,t,exp;
freopen("stramosi.in","r",stdin);
freopen("stramosi.out","w",stdout);
scanf("%d %d\n",&n,&m);
for (i=1; i<=n; ++i) scanf("%d",&os[i][0]);
for (i=1; i<=MAXL; ++i)
for (j=1;j<=n;++j)
os[j][i]=os[os[j][i-1]][i-1];
for (i=1; i<=m; ++i)
{
scanf("%d %d\n",&q,&p);
while (p)
{
for (t = 1, exp = 0; (t<<1) <= p; t <<=1, ++exp);
q = os[q][exp];
p-=t;
}
printf("%d\n",q);
}
return 0;
}