Pagini recente » Cod sursa (job #1072824) | Cod sursa (job #391381) | Cod sursa (job #2824817) | Cod sursa (job #2152616) | Cod sursa (job #2938588)
#include<fstream>
using namespace std;
#define nmax 250003
ifstream cin("stramosi.in");
ofstream cout("stramosi.out");
int dp[nmax][21],m,n,q,p,k;
int main()
{cin>>n>>m;
for(int i=1;i<=n;i++){
cin>>dp[i][0];
k=1;
while(dp[dp[i][k-1]][k-1]!=0)
{dp[i][k]=dp[dp[i][k-1]][k-1];
k++;
}
}
for(int i=1;i<=m;i++)
{
cin>>q>>p;
for(int k=18;k>=0,p!=0;k--)
{
if((1<<k)<=p){
p-=(1<<k);
q=dp[q][k];
}
}
cout<<q<<'\n';
}
}