Pagini recente » Cod sursa (job #824741) | Cod sursa (job #1906177) | Cod sursa (job #1268188) | Cod sursa (job #1797270) | Cod sursa (job #2515653)
/*#include <iostream>
#include<cstdio>
#define nmax 250001
FILE * f=fopen("stramosi.in","r");
FILE * g=fopen("stramosi.out","w");
using namespace std;
int a[nmax],b[20][nmax];
int main()
{
int n,m,i,x,y,k=1;
fscanf(f,"%d%d",&n,&m);
for(i=1;i<=n;i++)
{fscanf(f,"%d",&x);
a[i]=x;
}
for(i=1;i<=n;i++)
{
b[1][i]=a[a[i]];
b[0][i]=a[i];
}
int s=0,j;
do
{
k=1<<s;
s++;
}while(k<=n);
s=s-2;
for(i=2;i<=s;i++)
{
for(j=2;j<=s;j++)
{
b[i][j]=b[i-1][b[i-1][j]];
}
}
int s1=1;
do
{
s1++;
}while(1<<s1<=n);
int t1=3;
for(i=1;i<=m;i++)
{
s=0;
fscanf(f,"%d%d",&x,&y);
while(y>0)
{ s=0;
k=1;
while(k<=y)
{
s++;
k=1<<s;
}
s--;
k=k/2;
x=b[s][x];
y=y-k;
}
fprintf(g,"%d\n",x);
}
return 0;
}
*/
#include <iostream>
#include <fstream>
#define NMAX 250003
using namespace std;
ifstream fin("stramosi.in");
ofstream fout("stramosi.out");
int n, m;
int v[20][NMAX];
int main()
{
int x, y;
fin>>n>>m;
for(int i=1; i<=n; i++)
fin>>v[0][i];
for(int j=1; j<=17; j++){
for(int i=1; i<=n; i++)
v[j][i] = v[j-1][v[j-1][i]];
}
for(int i=0; i<m; i++)
{
fin>>x>>y;
for(int j=17; j>=0; j--)
{
if((1<<j)<=y)
{
y-=(1<<j);
x = v[j][x];
}
}
fout<<x<<'\n' ;
}
return 0;
}