Cod sursa(job #673171)
| Utilizator | Data | 3 februarie 2012 23:49:25 | |
|---|---|---|---|
| Problema | Stramosi | Scor | 80 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.49 kb |
// log
#include <stdio.h>
#define MAXN 250005
int a[19][MAXN];
int main(void)
{
int n,m,i,j,p,q,t;
freopen("stramosi.in","r",stdin);
freopen("stramosi.out","w",stdout);
scanf("%d %d",&n,&m);
for (i=1; i<=n; ++i) scanf("%d",&a[0][i]);
for (i=1; i<=18; ++i)
for (j=1;j<=n;++j)
a[i][j]=a[i-1][a[i-1][j]];
for (i=1; i<=m; ++i)
{
scanf("%d %d ",&q,&p);
while (p && q)
{
t=0;
while(1 << (t+1) < p) ++t;
q=a[t][q];
p-=1<<t;
}
printf("%d\n",q);
}
return 0;
}
