Pagini recente » Cod sursa (job #1761759) | Cod sursa (job #1799763) | Cod sursa (job #372219) | Cod sursa (job #2496100) | Cod sursa (job #2185838)
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("stramosi.in");
ofstream out("stramosi.out");
const int MAXN = 250005;
int n, m, log[MAXN];
int dp[MAXN][18];
void preprocess() {
log[1] = 0;
for (int i = 2; i <= n; ++i) {
log[i] = log[i / 2] + 1;
}
for (int j = 1; j <= 17; ++j) {
for (int i = 1; i <= n; ++i) {
dp[i][j] = dp[dp[i][j - 1]][j - 1];
}
}
}
int query(int x, int k) {
int mask = 1 << log[k];
for (int i = log[k]; i >= 0; --i) {
if ((mask & k) != 0) {
x = dp[x][i];
}
mask >>= 1;
}
return x;
}
int main()
{
in >> n >> m;
for (int i = 1; i <= n; ++i) in >> dp[i][0];
preprocess();
for (int i = 1; i <= m; ++i) {
int x, k;
in >> x >> k;
out << query(x, k) << "\n";
}
return 0;
}