Pagini recente » Cod sursa (job #2537844) | Cod sursa (job #2401742) | Cod sursa (job #2845068) | Cod sursa (job #354772) | Cod sursa (job #1841092)
#include <bits/stdc++.h>
using namespace std;
int dp[100][250001];
int main()
{
ifstream fin("stramosi.in");
ofstream fout("stramosi.out");
int n, m, i, q, p, put, pi, j;
fin >> n >> m;
for (i = 1; i<=n; ++i)
fin >> dp[0][i];
for (i = 1; i<= 25; ++i)
for (j = 1; j<=n; ++j)
dp[i][j] = dp[i-1][dp[i-1][j]];
for(i=0;i<m;++i)
{
fin >> q >> p;
put=0;
pi=1;
while(pi<<1 <=p)
++put, pi<<=1;
if(put > 24)
fout << "0\n";
else
{
for(j=put;j>=0 and q; --j)
{
if(1<<j <= p)
{
q = dp[j][q];
p-=(1<<j);
}
}
fout << q << '\n';}
}
return 0;
}