Pagini recente » Cod sursa (job #1138411) | Cod sursa (job #1199573) | Cod sursa (job #3123141) | Cod sursa (job #621277) | Cod sursa (job #2185823)
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("stramosi.in");
ofstream out("stramosi.out");
const int MAXN = 250005;
int n, m, father[MAXN];
int dp[MAXN][18];
void preprocess() {
for (int i = 1; i <= n; ++i) dp[i][0] = father[i];
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 pas = 17;
int salt;
while (k) {
salt = 1 << pas;
if (salt <= k) {
x = dp[x][pas];
k -= salt;
}
pas--;
}
return x;
}
int main()
{
in >> n >> m;
for (int i = 1; i <= n; ++i) in >> father[i];
preprocess();
for (int i = 1; i <= m; ++i) {
int x, k;
in >> x >> k;
out << query(x, k) << "\n";
}
return 0;
}