Pagini recente » Cod sursa (job #2973909) | Clasament plopy | Cod sursa (job #552028) | Cod sursa (job #753557) | Cod sursa (job #1632520)
#include <iostream>
#include <fstream>
#include <vector>
using namespace std;
int D[250005][19], N, M, Q, P, k;
void dinamica()
{
for( k=1; k<=N;k = k<<1);
k = k>>1;
for(int j=1; j<=k; ++j)
for(int i=1; i<=N; ++i)
D[i][j] = D[ D[i][j-1] ][j-1];
}
int main()
{
freopen("stramosi.in", "rt", stdin);
freopen("stramosi.out", "wt", stdout);
scanf("%d%d", &N, &M);
int x;
for(int i=1; i<=N; ++i)
scanf("%d", &D[i][0]);
dinamica();
for(int i=1; i<=M; ++i)
{
scanf("%d%d", &Q, &P);
for(int j=0; (1<<j)<=P; ++j)
if(P & (1<<j))
Q = D[Q][j];
cout<<Q<<'\n';
}
return 0;
}