Pagini recente » Cod sursa (job #2351243) | Cod sursa (job #2384889) | Cod sursa (job #1609986) | Cod sursa (job #1833640) | Cod sursa (job #2227543)
#include <bits/stdc++.h>
using namespace std;
ifstream in("stramosi.in");
ofstream out("stramosi.out");
const int MAXN = 25e4;
const int MAXM = 3e5;
const int MAXPUT = 17;
int n, m, dp[MAXPUT][MAXN + 1];
int main() {
in >> n >> m;
for (int i = 1; i <= n; ++ i) in >> dp[0][i];
int put = 31 - __builtin_clz(n);
for (int i = 1; i <= put; ++ i)
for (int j = 1; j <= n; ++ j)
dp[i][j] = dp[i - 1][dp[i - 1][j]];
int x, y;
while (m --) {
in >> y >> x;
put = 0;
while (x) {
if (x & 1) y = dp[put][y];
x >>= 1;
++ put;
}
out << y << '\n';
}
return 0;
}