Pagini recente » Cod sursa (job #1162904) | Cod sursa (job #2449455) | Cod sursa (job #1647162) | Cod sursa (job #108716) | Cod sursa (job #2153637)
#include <iostream>
#include <fstream>
using namespace std;
const int NMAX = 250001;
int stram[NMAX][19];
int main() {
ifstream in("stramosi.in");
ofstream ou("stramosi.out");
int n, m, q, p;
in >> n >> m;
for(int i = 1; i <= n; ++i) {
in >> stram[i][0];
}
for(int i = 1; i <= 18; ++i) {
for(int j = 1; j <= n; ++j) {
stram[j][i] = stram[stram[j][i - 1]][i - 1];
}
}
for(int nrq = 0; nrq < m; ++nrq) {
in >> q >> p;
for(int pp = 0; p > 0; p >>= 1, ++pp) {
if(p & 1) {
q = stram[q][pp];
}
}
ou << q << '\n';
}
return 0;
}