Pagini recente » Cod sursa (job #3329702) | Cod sursa (job #3301055) | Cod sursa (job #3314933) | Cod sursa (job #1473093) | Cod sursa (job #3322358)
#include <iostream>
#include <random>
#include <fstream>
#include <bitset>
using namespace std;
ifstream fin("stramosi.in");
ofstream fout("stramosi.out");
int dp[19][250001];
int main() {
int n,m;
fin>>n>>m;
for (int i=1; i<=n; i++)
fin>>dp[0][i];
for (int i=1; i<=18; i++)
for (int j=1; j<=n; j++)
dp[i][j]=dp[i-1][dp[i-1][j]];
while (m--) {
int p,q,ans;
fin>>q>>p;
ans=q;
for (int i=0; (1<<i)<=p; i++) {
if ((1<<i) & p)
ans=dp[i][ans];
}
fout<<ans<<"\n";
}
return 0;
}