Pagini recente » Cod sursa (job #1964819) | Cod sursa (job #1987) | Cod sursa (job #2576134) | Cod sursa (job #1130330) | Cod sursa (job #428658)
Cod sursa(job #428658)
#include <iostream>
#include <cstring>
#include <cstdio>
#include <algorithm>
using namespace std;
void open(){
freopen("stramosi.in","r",stdin);
freopen("stramosi.out","w",stdout);
}
int n,m,par[250010][18],Q,P,now,bit[18],maxi,x;
int log_2(int a){
int i=1;
for (;(1<<i)<=a;i++);
return i-1;
}
void get_int(int &a){
char c;
while (c=getchar()){
if (c>='0' && c<='9'){
a=c-'0';
break;
}
}
while (c=getchar()){
if (c>='0' && c<='9'){
a=(a<<1)+(a<<3)+(c-'0');
}
else break;
}
}
int main(){
open();
get_int(n);get_int(m);
for (int i=1;i<=n;i++){
get_int(par[i][0]);
}
for (int i=1;(1<<i)<=n;i++){
for (int j=1;j<=n;j++){
par[j][i]=par[par[j][i-1]][i-1];
}
}
for (int i=0;i<m;i++){
get_int(Q);get_int(P);
memset(bit,0,sizeof(bit));
now=Q;
for (int j=0;P;j++){
if ((1<<j) & P){
bit[j]=1;
P-=(1<<j);
maxi=j;
}
}
x=maxi;
while (1){
if (bit[x]){
now=par[now][x];
}
x--;
if (x==-1) break;
}
printf("%d\n",now);
}
//system("pause");
return 0;
}