Pagini recente » Cod sursa (job #495466) | Cod sursa (job #2145992) | Cod sursa (job #2556743) | Cod sursa (job #1947295) | Cod sursa (job #1482794)
#include <cstdio>
#include <iostream>
using namespace std;
int main() {
freopen("stramosi.in", "r", stdin);
freopen("stramosi.out", "w", stdout);
ios::sync_with_stdio(false);
cin.tie(0);
int n, m, s[250005][20], logm = 19;
for (int i = 0; i <= logm; i++) {
s[0][i] = 0;
}
cin >> n >> m;
for (int i = 1; i <= n; i++) {
cin >> s[i][1];
}
for (int j = 2; j <= logm; j++) {
for (int i = 1; i <= n; i++) {
s[i][j] = s[s[i][j - 1]][j - 1];
}
}
for (int i = 1; i <= m; i++) {
int q, p, r = 1;
cin >> q >> p;
while (q != 0 && p > 0) {
if (p % 2 == 1) {
q = s[q][r];
}
p /= 2;
r++;
}
cout << q << "\n";
}
return 0;
}