Pagini recente » Cod sursa (job #866689) | Cod sursa (job #2049349) | Cod sursa (job #1836364) | Cod sursa (job #1193031) | Cod sursa (job #3123739)
#include <bits/stdc++.h>
using namespace std;
int main() {
ifstream cin("stramosi.in");
ofstream cout("stramosi.out");
int n, m; cin >> n >> m;
vector<int> par(n + 1);
par[n] = n;
for (int i = 1; i <= n; ++i) {
cin >> par[n - i];
par[n - i] = n - par[n - i];
}
vector<pair<int, int>> q(m);
for (int i = 0; i < m; ++i) {
cin >> q[i].first >> q[i].second;
q[i].first = n - q[i].first;
}
for (int d = 0; d < 18; ++d) {
for (int i = 0; i < m; ++i)
if (q[i].second & (1 << d))
q[i].first = par[q[i].first];
for (int i = 0; i < n; i++)
par[i] = par[par[i]];
}
for (int i = 0; i < m; ++i)
cout << n - q[i].first << "\n";
return 0;
}