Pagini recente » Cod sursa (job #625069) | Cod sursa (job #2637206) | Cod sursa (job #1686508) | Cod sursa (job #77254) | Cod sursa (job #3237560)
#include <fstream>
#include <vector>
#include <set>
#include <cmath>
using namespace std;
ifstream cin ("stramosi.in");
ofstream cout ("stramosi.out");
long long int t,n,i,j,d,k,m,x,y,a[250005],b[250005][25],q,p,ans,sum,l,r,mini,nr,maxi,node;
const int MOD=1e9+7;
vector<pair<int,int>>graf[300005];
set<pair<int,int>>s;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cin>>n>>m;
for(i=1; i<=n; i++)
cin>>a[i];
for(j=1; j<=20; j++)
for(i=1; i<=n; i++)
{
if(j==1)
b[i][j]=a[a[i]];
else
b[i][j]=b[b[i][j-1]][j-1];
}
for(i=1;i<=m;i++)
{
cin>>q>>p;
ans=q;
for(j=20; j>=0 && ans!=0; j--)
{
if(j==0 && p>=1)
{
ans=a[ans];
p--;
}
else
if(pow(2,j)<=p)
{
ans=b[ans][j];
p-=pow(2,j);
}
}
cout<<ans<<'\n';
}
return 0;
}