Pagini recente » Istoria paginii runda/pre_oji2011 | Cod sursa (job #2199215) | Cod sursa (job #965164) | Cod sursa (job #549741) | Cod sursa (job #983420)
Cod sursa(job #983420)
#include <fstream>
#include <cmath>
#define ll long long int
using namespace std;
ifstream cin("stramosi.in");
ofstream cout("stramosi.out");
int i,j,p,e,n,q;
int v[300002];
int m[21][300002];
int main()
{
cin>>n>>q;
for(i=1;i<=n;++i) {cin>>v[i];m[0][i]=v[i];}
for(i=1;i<=n;++i) for(j=1;j<=20;++j) {m[j][i]=m[j-1][m[j-1][i]];}
for(i=1;i<=q;++i)
{
cin>>p>>e;
while(e)
{
p=m[(int)log(e)][p];
e-=1<<((int)log(e));
}
cout<<p<<'\n';
}
return 0;
}