Cod sursa(job #2990786)
| Utilizator | Data | 8 martie 2023 15:55:03 | |
|---|---|---|---|
| Problema | Stramosi | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.64 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream in ("stramosi.in");
ofstream out ("stramosi.out");
const int NMAX = 250000;
int rmq[NMAX + 5][18];
int main()
{
int n, q;
in >> n >> q;
for (int i=1; i<=n; i++)
in >> rmq[i][0];
for (int j=1; (1<<j)<=n; j++)
{
for (int i=1; i<=n; i++)
rmq[i][j] = rmq[rmq[i][j-1]][j-1];
}
while (q--)
{
int u, k;
in >> u >> k;
for (int bt=17; bt>=0; bt--)
{
if (k & (1 << bt))
u = rmq[u][bt];
}
out << u << '\n';
}
return 0;
}
