Pagini recente » Cod sursa (job #2029043) | Cod sursa (job #385230) | Cod sursa (job #281285) | Cod sursa (job #306063) | Cod sursa (job #1459614)
#include <fstream>
#define dim 250001
using namespace std;
ifstream fin("stramosi.in");
ofstream fout("stramosi.out");
int T[21][dim],k,i,n,m,grade,node;
int main()
{
fin>>n>>m;
for(i=1;i<=n;i++)
fin>>T[0][i];
for(k=1;k<=20;k++)
for(i=1;i<=n;i++)
T[k][i]=T[k-1][T[k-1][i]];
for(i=1;i<=m;i++)
{
fin>>node>>grade;
for(k=20;k>=0&&node&&grade;k--)
if((1 << k)<=grade)
{
node=T[k][node];
grade-= 1 << k;
}
fout<<node<<'\n';
}
return 0;
}