Pagini recente » Cod sursa (job #421452) | Cod sursa (job #2948974) | Cod sursa (job #3154480) | Cod sursa (job #2384087) | Cod sursa (job #3301641)
#include <bits/stdc++.h>
using namespace std;
ifstream fin("stramosi.in");
ofstream fout("stramosi.out");
int dp[20][250005];
int main()
{
int n,m;
fin >> n >> m;
for (int i=1;i<=n;++i){
fin >> dp[0][i];
}
for (int p=1;p<20;++p){
for (int i=1;i<=n;++i){
dp[p][i] = dp[p-1][dp[p-1][i]];
}
}
for (int i=1;i<=m;++i){
int nod,k;
fin >> nod >> k;
for (int bit=0;bit<20;++bit){
if (((1<<bit)&k)>0){
nod = dp[bit][nod];
}
}
fout << nod << '\n';
}
return 0;
}