Pagini recente » Cod sursa (job #1475991) | Cod sursa (job #2389656) | Cod sursa (job #1693312) | Cod sursa (job #1065587) | Cod sursa (job #1647737)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f ("stramosi.in");
ofstream g ("stramosi.out");
int r[300000];
int pow(int a, int p)
{
int sol=1;
while (p)
{
if (p%2) sol*=a;
a*=a;
p/=2;
}
return sol;
}
int log2(int p)
{
int sol=0;
while (p>1)
sol++,p/=2;
return sol;
}
int n,m, a[300000][50],q,p;
int main()
{
f>>n>>m;
for (int i=1;i<=n;i++)
f>>a[i][0];
for (int j=1;j<=16;j++)
for (int i=1;i<=n;i++)
{
a[i][j]= a[a[i][j-1]][j-1];
if (a[i][j]==0&&r[i]==0) r[i]=pow(2,j);
}
for (int i=1;i<=m;i++)
{
f>>q>>p;
if (p>r[q]) g<<0<<'\n';
else
{
while (p)
{
int x=log2(p);
q=a[q][x];
p=p-pow(2,x);
}
g<<q<<'\n';
}
}
return 0;
}