Pagini recente » Cod sursa (job #496580) | Cod sursa (job #3262491) | Cod sursa (job #1378671) | Cod sursa (job #2711960) | Cod sursa (job #3229636)
#include <bits/stdc++.h>
using namespace std;
int up[250005][40], n, m;
int k_th(int q, int p) {
int ans = q;
for (int i = 0; i < __builtin_popcountll(n); i++) {
if (p & (1 << i)) {
ans = up[ans][i];
}
}
return ans;
}
int main()
{
freopen("stramosi.in", "r", stdin);
freopen("stramosi.out", "w", stdout);
cin.tie(0)->sync_with_stdio(0);
cin >> n >> m;
for (int i = 1; i <= n; i++)
{
int a;
cin >> a;
up[i][0] = a;
}
for (int j = 1; (1 << j) <= n; j++) {
for (int i = 1; i <= n; i++) {
up[i][j] = up[up[i][j - 1]][j - 1];
}
}
while (m--)
{
int q, p;
cin >> q >> p;
cout << k_th(q, p) << '\n';
}
return 0;
}