Pagini recente » Cod sursa (job #449623) | Cod sursa (job #2514050) | Cod sursa (job #1344535) | Cod sursa (job #2042567) | Cod sursa (job #2429362)
#include <fstream>
#define NMAX 250010
std::ifstream fin("stramosi.in");
std::ofstream fout("stramosi.out");
int n, q;
int dp[NMAX][19];
int main() {
fin >> n >> q;
for (int i = 1; i <= n; i++)
fin >> dp[i][0];
for (int j = 1; (1 << j) <= n; j++)
for (int i = 1; i <= n; i++)
dp[i][j] = dp[dp[i][j - 1]][j - 1];
for (int it = 0; it < q; it++) {
int q, p; fin >> q >> p;
int ancestor = q;
for (int i = 18; i >= 0; i--)
if (p & (1 << i))
ancestor = dp[ancestor][i];
fout << ancestor << '\n';
}
fout.close();
return 0;
}