# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
852586 | sleepntsheep | Secret (JOI14_secret) | C++17 | 404 ms | 4428 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "secret.h"
#define N 1005
int n, *a, st[10][N];
void Init(int n_, int *a_)
{
n = n_; a = a_;
for (int i = 0; i < n; ++i) st[0][i] = a[i];
for (int h = 1; (1 << h) <= n; ++h)
{
for (int j = 0; j < n; ++j)
{
if (j + (1 << h) > n) continue;
st[h][j] = Secret(st[h-1][j], st[h-1][j+(1<<(h-1))]);
}
}
}
int Query(int l, int r)
{
int z = a[l++];
for (int h = 10; h >= 0; --h)
{
if ((1 << h) <= r-l+1)
{
z = Secret(z, st[h][l]);
l += 1 << h;
}
}
return z;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |