Pagini recente » Cod sursa (job #2330327) | Cod sursa (job #2741111) | Cod sursa (job #1487794) | Cod sursa (job #1163484) | Cod sursa (job #1976343)
#include <cstdio>
using namespace std;
const int nmax=250000;
int d[nmax+1][18];
int main(){
freopen("stramosi.in","r",stdin);
freopen("stramosi.out","w",stdout);
int n,m;
scanf("%d%d",&n,&m);
for (register int i=1;i<=n;i++){
scanf("%d",&d[i][0]);
}
for (register int j=1;j<=17;j++)
{
for (register int i=1;i<=n;i++){
d[i][j]=d[d[i][j-1]][j-1];
}
}
int q,p;
for (register int t=1;t<=m;t++){
scanf("%d%d",&q,&p);
for (int i=0;i<=17;i++){
if ((1<<i)&p){
q=d[q][i];
}
}
printf("%d\n",q);
}
return 0;
}