Cod sursa(job #2740612)
Utilizator | Data | 13 aprilie 2021 17:18:52 | |
---|---|---|---|
Problema | Stramosi | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.64 kb |
#include <bits/stdc++.h>
using namespace std;
int d[300000][25];
int n,q,x,y,p,nod,mos;
int main()
{
ifstream fin("stramosi.in");
ofstream fout("stramosi.out");
fin>>n>>q;
for(int i=1; i<=n; i++)
{
fin>>x;
d[i][0]=x;
}
for(int i=1; i<=n; i++)
for(int j=1; j<=20; j++)
d[i][j]=d[d[i][j-1]][j-1];
for( ; q--; )
{
fin>>nod>>mos;
p=0;
while(mos)
{
if(mos%2)
nod=d[nod][p];
p++;
mos=mos/2;
}
fout<<nod<< "\n";
}
return 0;
}