Cod sursa(job #1803878)
| Utilizator | Data | 11 noiembrie 2016 23:12:14 | |
|---|---|---|---|
| Problema | Stramosi | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | cerculdeinfo-lectia6-arbori | Marime | 0.65 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("stramosi.in");
ofstream g("stramosi.out");
int n,m,i,j,t[21][250001],p,q,pas,x;
int main()
{
f>>n>>m;
for(i=1;i<=n;i++) f>>t[1][i];
for(i=1;i<=n;i++)
{
for(j=2;j<=18;j++)
{
t[j][i]=t[j-1][t[j-1][i]];
}
}
for(i=1;i<=m;i++)
{
f>>q>>p;
pas=1;
pas=18;
while(pas)
{
if(1<<(pas-1)<=p)
{
q=t[pas][q];
p-=1<<(pas-1);
}
pas--;
}
g<<q<<'\n';
}
return 0;
}
