Cod sursa(job #2883008)
Utilizator | Covei Denis cdenis | Data | 1 aprilie 2022 01:17:16 |
---|---|---|---|
Problema | Stramosi | Scor | 90 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.61 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("stramosi.in");
ofstream fout("stramosi.out");
const int MAX=25e4+5;
const int LOG=20;
int n,m,up[MAX][LOG];
int main()
{
fin >> n >> m;
for(int i=1;i<=n;i++)
fin >> up[i][0];
for(int i=1;(1<<i)<=n;i++)
for(int nod=1;nod<=n;nod++)
up[nod][i]=up[up[nod][i-1]][i-1];
while(m--)
{
int k,nod;
fin >> nod >> k;
for(int i=0;(1<<i)<=k;i++)
if(k&(1<<i))
nod=up[nod][i];
fout << nod << '\n';
}
return 0;
}