Pagini recente » Cod sursa (job #1224388) | Cod sursa (job #1635777) | Cod sursa (job #3179648) | Cod sursa (job #3194321) | Cod sursa (job #2429360)
#include <vector>
#include <fstream>
using std::vector;
std::ifstream fin("stramosi.in");
std::ofstream fout("stramosi.out");
int main() {
int n, q; fin >> n >> q;
vector<vector<int>> dp(n + 1, vector<int>(19));
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;
}