Pagini recente » Cod sursa (job #3180638) | Cod sursa (job #595306) | Cod sursa (job #1597709) | Cod sursa (job #1076756) | Cod sursa (job #1146833)
#include<cstdio>
const int LOG_MAX_N=20,MAX_N=250000;
int d[LOG_MAX_N+1][MAX_N];
int n,m;
void scan(){
int i;
scanf("%d%d",&n,&m);
for(i=1;i<=n;i++)
scanf("%d",&d[0][i]);
}
void setD(){
int i,j;
for(i=1;1<<i<=n;i++)
for(j=1;j<=n;j++)
d[i][j]=d[i-1][d[i-1][j]];
}
void init(){
freopen("stramosi.in","r",stdin);
freopen("stramosi.out","w",stdout);
scan();
setD();
}
int querry(int p,int q){
int pas=1<<LOG_MAX_N,power=LOG_MAX_N;
while(pas>0){
if(pas<=p){
p-=pas;
q=d[power][q];
}
pas/=2;
power--;
}
return q;
}
int main(){
int p,q;
init();
while(m>0){
m--;
scanf("%d%d",&q,&p);
printf("%d\n",querry(p,q));
}
return 0;
}