Pagini recente » Cod sursa (job #956044) | Arhiva de probleme | Cod sursa (job #2456261) | Cod sursa (job #334129) | Cod sursa (job #2053589)
#include<fstream>
using namespace std;
ifstream fin("stramosi.in");
ofstream fout("stramosi.out");
int n,i,j,k,m,l,c,q,p,x,sol;
int L[250005];
int D[30][250005];
int main(){
fin>>n>>m;
for(i=2;i<=n;i++){
L[i]=L[i/2]+1;
}
for(i=1;i<=n;i++){
fin>>D[0][i];
}
for(k=1;k<=L[n];k++){
for(i=1;i<=n;i++){
D[k][i]=D[k-1][D[k-1][i]];
}
}
int q1;
for(i=1;i<=m;i++){
fin>>q>>p;
while(p!=0){
x=L[p];
q1=q;
q=D[x][q1];
p-=(1<<x);
}
fout<<q<<"\n";
}
return 0;
}