Pagini recente » Cod sursa (job #3198483) | Cod sursa (job #749575) | Cod sursa (job #2622546) | Cod sursa (job #1094185) | Cod sursa (job #2481135)
#include <bits/stdc++.h>
using namespace std;
ifstream in("stramosi.in");
ofstream out("stramosi.out");
const int NMax = 250000;
int N, M, TT[NMax+5];
void Read() {
in >> N >> M;
for (int i = 1; i <= N; i++) {
in >> TT[i];
}
}
int Ancestor(int q, int p) {
for (int i = 1; i <= p; i++) {
q=TT[q];
}
return q;
}
void Solve() {
for (int i = 1, q, p; i <= M; i++) {
in >> q >> p;
out << Ancestor(q,p) << '\n';
}
}
int main() {
Read();
Solve();
}