Pagini recente » Cod sursa (job #2218654) | Cod sursa (job #528237) | Cod sursa (job #280451) | Algoritmiada 2012 - Clasament | Cod sursa (job #2070586)
#include<fstream>
using namespace std;
ifstream fin("stramosi.in");
ofstream fout("stramosi.out");
int n,m,dp[250005][21],puteri[25];
inline void Citire()
{
int i,j;
fin>>n>>m;
for (i=1;i<=n;i++)
fin>>dp[i][0];
puteri[0]=1;
for (j=1;j<=20;j++)
puteri[j]=puteri[j-1]<<1;
for (i=1;i<=n;i++)
for (j=1;puteri[j]<=n;j++)
dp[i][j]=dp[dp[i][j-1]][j-1];
}
inline void DP()
{
int i,Q,p;
while (m--)
{
fin>>Q>>p;
while (Q && p)
{
for (i=0;puteri[i]<=p;i++); i--;
Q=dp[Q][i];
p-=puteri[i];
}
fout<<Q<<"\n";
}
}
int main()
{
Citire();
DP();
return 0;
}