Pagini recente » Cod sursa (job #2801714) | Cod sursa (job #3283321) | Cod sursa (job #381176) | Cod sursa (job #3283056) | Cod sursa (job #1377791)
#include <fstream>
using namespace std;
ifstream in("stramosi.in");
const int kLgMax = 20, kNMax = 250005;
int n, m;
int dp[kLgMax][kNMax];
void Citire() {
in >> n >> m;
for (int i = 1; i <= n; ++i)
in >> dp[0][i];
}
void Precalculare() {
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]];
}
void Query() {
ofstream out("stramosi.out");
int x, y;
while(m--) {
in >> x >> y;
for (int i = 0; (1 << i) <= y; ++i)
if ((1 << i) & y)
x = dp[i][x];
out << x << '\n';
}
out.close();
}
void Solve() {
Precalculare();
Query();
}
int main() {
Citire();
Solve();
return 0;
}