Pagini recente » Cod sursa (job #2525476) | Cod sursa (job #203588) | Cod sursa (job #1060171) | Cod sursa (job #2510099) | Cod sursa (job #847381)
Cod sursa(job #847381)
#include <fstream>
#include <cstring>
using namespace std;
ifstream fin("stramosi.in");
ofstream fout("stramosi.out");
#define MAXN 260000
int s[MAXN][20];
int N, M;
void doStramosi() {
for (int i = 1; (1 << i) < N; ++i) {
for (int j = 1; j <= N; ++j)
s[j][i] = s[s[j][i - 1]][i - 1];
}
}
int main() {
fin >> N >> M;
for (int i = 1; i <= N; ++i)
fin >> s[i][0];
doStramosi();
for (int i = 1; i <= M; ++i) {
int nod, adan;
fin >> nod >> adan;
while (adan != 0 && nod != 0) {
int j = 1;
for (j = 1; (1 << j) <= adan; ++j); --j;
nod = s[nod][j];
adan -= (1 << j);
}
fout << nod << "\n";
}
return 0;
}