Pagini recente » Cod sursa (job #1660652) | Cod sursa (job #788668) | Cod sursa (job #3122719) | Cod sursa (job #2955998) | Cod sursa (job #2283166)
#include <bits/stdc++.h>
using namespace std;
ifstream in("stramosi.in");
ofstream out("stramosi.out");
const int NMax = 250005;
const int LMax = 20;
int v[NMax][LMax];
int main(){
int n, m, p, node;
in >> n >> m;
for(int i = 1; i <= n; i++){
in >> v[i][0];
}
for(int j = 1; j < LMax; j++){
for(int i = 1; i <= n; i++){
v[i][j] = v[v[i][j - 1]][j - 1];
}
}
for(int i = 1; i <= m; i++){
in >> node >> p;
for(int i = 0; i < LMax; i++){
if((p >> i) % 2 == 1){
node = v[node][i];
}
}
out << node << "\n";
}
return 0;
}