Cod sursa(job #2903567)
| Utilizator | Data | 17 mai 2022 18:17:34 | |
|---|---|---|---|
| Problema | Stramosi | Scor | 90 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.53 kb |
#include<bits/stdc++.h>
using namespace std;
ifstream f("stramosi.in");
ofstream g("stramosi.out");
int m[19][250003];
int main()
{
int n, q, i, j, poz, k, rez;
f>>n>>q;
for(i=1; i<=n; i++)
f>>m[0][i];
for(i=1; i<=18; i++)
for (j=1; j<=n; j++)
m[i][j]=m[i-1][m[i-1][j]];
for(i=1; i<=q; i++)
{
f>>poz>>k;
rez=0;
while(k>0)
{
if(k%2==1) poz=m[rez][poz];
rez++;
k/=2;
}
g<<poz<<"\n";
}
return 0;
}