Pagini recente » Cod sursa (job #2414405) | Cod sursa (job #1714207) | Cod sursa (job #495584) | Cod sursa (job #1264518) | Cod sursa (job #2185846)
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("stramosi.in");
ofstream out("stramosi.out");
const int L = 1 << 17;
const int MAXN = 250005;
int n, m;
int dp[18][MAXN];
void preprocess() {
for (int j = 1; j <= 17; ++j) {
for (int i = 1; i <= n; ++i) {
dp[j][i] = dp[j - 1][dp[j - 1][i]];
}
}
}
int query(int x, int k) {
int pas = 17;
while (pas >= 0) {
if (1 << pas <= k) {
x = dp[pas][x];
k -= 1 << pas;
}
pas--;
}
return x;
}
int main()
{
in >> n >> m;
for (int i = 1; i <= n; ++i) in >> dp[0][i];
preprocess();
for (int i = 1; i <= m; ++i) {
int x, k;
in >> x >> k;
out << query(x, k) << "\n";
}
return 0;
}