Cod sursa(job #2862363)
| Utilizator | Data | 5 martie 2022 12:13:50 | |
|---|---|---|---|
| Problema | Stramosi | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.67 kb |
#include <fstream>
using namespace std;
ifstream fin("stramosi.in");
ofstream fout("stramosi.out");
int t[250001][20];
int log2[250001];
int main()
{
int n,m,q,p;
fin>>n>>m;
for(int i=1; i<=n; i++)
fin>>t[i][0];
for(int i=1; i<=n; i++)
{
for(int j=1; (1<<j)<=n; j++)
{
t[i][j]=t[t[i][j-1]][j-1];
}
}
log2[1]=0;
for(int i=2; i<=n; i++)
log2[i]=log2[i/2]+1;
for(int i=1; i<=m; i++)
{
fin>>q>>p;
while(p>0)
{
int x=log2[p];
q=t[q][x];
p-=(1<<x);
}
fout<<q<<'\n';
}
return 0;
}
