Pagini recente » Cod sursa (job #1220748) | Cod sursa (job #1073053) | Cod sursa (job #596542) | Cod sursa (job #1897059) | Cod sursa (job #1827766)
#include <bits/stdc++.h>
using namespace std;
ifstream f("stramosi.in");
ofstream g("stramosi.out");
const int nMax = 250003;
int dp[20][nMax];
int main()
{
int n, m, p, q, x;
f >> n >> m;
for(int i = 1; i <= n; i++) {
f >> x;
dp[0][i] = x;
}
for(int i = 1; (1 << i) <= n; i++) {
for(int j = 1; j <= n; j++) {
dp[i][j] = dp[i - 1][dp[i - 1][j]];
}
}
for(int i = 1; i <= m; i++) {
f >> p >> q;
for(int j = 0; j <= 20; j++) {
if((q & (1 << j))) {
p = dp[j][p];
}
}
g << p << "\n";
}
return 0;
}