Pagini recente » Cod sursa (job #263710) | Cod sursa (job #345908) | Cod sursa (job #1931808) | Cod sursa (job #1676298) | Cod sursa (job #3297602)
#include <iostream>
#include <fstream>
#include <vector>
std::ifstream fin("stramosi.in");
std::ofstream fout("stramosi.out");
int N,M,P,Q, up[250005][18];
int main(){
fin >> N >> M;
int log = 0;
while ( (1 << log) <= N){
log++;
}
for ( int i = 1; i <= N; i++ ){
fin >> up[i][0];
}
for ( int i = 1; i < log; i++ ){
for ( int node = 1; node <= N; node++ ){
up[node][i] = up[up[node][i-1]][i-1];
}
}
for ( int i = 0; i < M; i++ ){
fin >> Q >> P;
for ( int j = 0; j < log; j++ ){
if ( P & (1<<j) ){
Q = up[Q][j];
if ( Q == 0 ){
break;
}
}
}
fout << Q << '\n';
}
return 0;
}