Pagini recente » Cod sursa (job #63283) | Cod sursa (job #2191051) | Cod sursa (job #1281088) | Cod sursa (job #1313994) | Cod sursa (job #3202172)
#include <fstream>
using namespace std;
ifstream fin("stramosi.in");
ofstream fout("stramosi.out");
int dp[20][250005];
int str(int nod, int ordin) {
int i = 0;
while (ordin) {
if (ordin % 2) {
nod = dp[i][nod];
}
i++;
ordin /= 2;
}
return nod;
}
int main() {
int n, m;
fin >> n >> m;
for (int i = 1; i <= n; ++i) {
fin >> dp[0][i];
}
for (int i = 1; (1 << i) <= n; ++i) {
for (int j = 1; j <= n; ++j) {
if (dp[i - 1][j]) {
dp[i][j] = dp[i - 1][dp[i - 1][j]];
}
}
}
while (m--) {
int q, p;
fin >> q >> p;
fout << str(q, p) << '\n';
}
return 0;
}