Cod sursa(job #2904804)
Utilizator | Data | 18 mai 2022 02:00:36 | |
---|---|---|---|
Problema | Range minimum query | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.62 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("stramosi.in");
ofstream g("stramosi.out");
int n, m, a[20][250003];
int main()
{
int i, j, x, k, res;
f >> n >> m;
for (i = 1; i <= n; i++)
f >> a[0][i];
for (i = 1; i <= 18; i++)
for (j = 1; j <= n; j++)
a[i][j] = a[i-1][a[i-1][j]];
for (i = 1; i <= m; i++)
{
f >> x >> k;
res = 0;
while (k > 0)
{
if (k % 2 == 1) x = a[res][x];
res++;
k = k>>1;
}
g << x << endl;
}
return 0;
}