Pagini recente » Cod sursa (job #956067) | Cod sursa (job #2866647) | agm-2018-testare | Cod sursa (job #1184204) | Cod sursa (job #1253278)
#include <iostream>
#include <cstdio>
using namespace std;
#define maxN 250005
#define maxLog 25
#define maxLLog 19
long n,m,i,j,q,p,tmp;
long dp[maxN][maxLog];
bool util;
int main()
{
freopen("stramosi.in","r",stdin);
freopen("stramosi.out","w",stdout);
scanf("%ld %ld\n",&n,&m);
for(i=1;i<=n;i++) scanf("%ld",&dp[i][0]);
for(j=1;j<=maxLLog;j++){
util = false;
for(i=1;i<=n;i++){
dp[i][j] = dp[dp[i][j-1]][j-1];
if(dp[i][j]) util = true;
}
if(!util) break;
}
for(;m;m--){
scanf("%ld %ld",&q,&p);
i = 0; tmp = 1;
while(tmp << 1 <= p) tmp <<= 1,i++;
while(i>=0){
if(p&tmp) q = dp[q][i];
tmp >>= 1;
i--;
if(!q) break;
}
printf("%ld\n",q);
}
return 0;
}