Pagini recente » Cod sursa (job #3329095) | Cod sursa (job #3320447) | Borderou de evaluare (job #3318021) | Cod sursa (job #3327428) | Cod sursa (job #3323981)
#include <fstream>
#include <vector>
using namespace std;
ifstream cin("stramosi.in");
ofstream cout("stramosi.out");
const int NMAX = 3000005;
vector<int> adj[NMAX];
vector<pair<int, int>> op[NMAX];
int ans[NMAX];
vector<int> st;
void dfs(int nod) {
st.push_back(nod);
for (auto o: op[nod]) {
if (st.size() <= o.first) {
continue;
}
ans[o.second] = st[st.size() - o.first - 1];
}
for (auto i: adj[nod]) {
dfs(i);
}
st.pop_back();
}
int main() {
int n, q;
cin >> n >> q;
vector<int> roots;
for (int i = 1; i <= n; i++) {
int nod; cin >> nod;
if (nod != 0) {
adj[nod].push_back(i);
} else {
roots.push_back(i);
}
}
for (int i = 1; i <= q; i++) {
int nod, k; cin >> nod >> k;
op[nod].push_back({k, i});
}
for (auto root: roots) {
dfs(root);
}
for (int i = 1; i <= q; i++) {
cout << ans[i] << '\n';
}
}