Pagini recente » Cod sursa (job #1038973) | Cod sursa (job #2726854) | Cod sursa (job #2306722) | Cod sursa (job #2946762) | Cod sursa (job #3184724)
#include <fstream>
using namespace std;
ifstream fin("stramosi.in");
ofstream fout("stramosi.out");
const int maxN = (int)2e5 + (int)5e4;
const int maxLog = 18;
int stramosi[maxN + 5][maxLog];
int main(){
int n, m;
fin >> n >> m;
for (int i = 1; i <= n; i++) {
fin >> stramosi[i][0];
}
for (int j = 1; j < maxLog; j++){
for (int i = 1; i <= n; i++){
stramosi[i][j] = stramosi[stramosi[i][j - 1]][j - 1];
}
}
for (int i = 1; i <= m; i++){
int p, q;
fin >> q >> p;
for (int j = maxLog - 1; j >= 0; j--){
if ((1 << j) & p){
q = stramosi[q][j];
}
}
fout << q << '\n';
}
return 0;
}