Pagini recente » Cod sursa (job #2641285) | Cod sursa (job #486802) | Cod sursa (job #1085206) | Cod sursa (job #772197) | Cod sursa (job #1630648)
#include <fstream>
using namespace std;
ifstream f("stramosi.in");
ofstream g("stramosi.out");
long n,m,i,j,p,nr,q,dp[250005][30];
long stramos(long q,long p)
{
long P=1,nr=0;
if (q==0)
return 0;
while (P<<1<=p)
{
P<<=1;
nr++;
}
if (P==p)
return dp[q][nr];
return stramos(dp[q][nr],p-P);
}
int main()
{
f>>n>>m;
for (i=1;i<=n;i++)
f>>dp[i][0];
p=1;
while (p<<1<=n)
{
p<<=1;
nr++;
}
p=0;
for (j=1;j<=nr;j++)
for (i=1;i<=n;i++)
dp[i][j]=dp[dp[i][j-1]][j-1];
for (i=1;i<=m;i++)
{
f>>q>>p;
g<<stramos(q,p)<<'\n';
}
return 0;
}