Pagini recente » Cod sursa (job #1085373) | Cod sursa (job #2944551) | Cod sursa (job #3203014) | Cod sursa (job #2754637) | Cod sursa (job #847386)
Cod sursa(job #847386)
#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;
int bit;
for (bit = 1; (1 << bit) <= adan; ++bit); --bit;
while (adan != 0 && nod != 0) {
nod = s[nod][bit];
adan -= (1 << bit);
for (; (1 << bit) > adan; --bit);
}
fout << nod << "\n";
}
return 0;
}