Pagini recente » Cod sursa (job #2484451) | Cod sursa (job #2442537) | Cod sursa (job #2667149) | Cod sursa (job #935556) | Cod sursa (job #3132981)
// https://infoarena.ro/problema/stramosi
#include <bits/stdc++.h>
using namespace std;
#define endl '\n'
ifstream fin("stramosi.in");
ofstream fout("stramosi.out");
const int MAXN=250005;
int p[MAXN], anc[18][MAXN];
int main() {
int n, m;
fin>>n>>m;
for (int i=1; i<=n; ++i) {
int x;
fin>>x;
p[i] = x;
}
for (int i=1; i<=n; ++i) anc[0][i] = p[i];
for (int h=1; h<18; ++h) {
for (int i=1; i<=n; ++i) anc[h][i] = anc[h-1][anc[h-1][i]];
}
while (m--) {
int q, i;
fin>>q>>i;
int curr=q;
for (int j=0; j<18; ++j) {
if (i&(1<<j)) curr = anc[j][curr];
}
fout<<curr<<endl;
}
}