# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
988098 | icyalmond | Secret (JOI14_secret) | C++17 | 371 ms | 12204 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"
int n, pref[1005][15], suf[1005][15], a[1005], mask[1005];
void build(int l, int r, int h)
{
int m = l + 1 >> 1;
suf[m][h] = a[m];
for (int i = m - 1; i >= l; i--) suf[i][h] = Secret(suf[i + 1][h], a[i]);
pref[m + 1][h] = a[m + 1];
for (int i = m + 2; i <= r; i++) pref[i][h] = Secret(pref[i - 1][h], a[i]);
for (int i = m + 1; i <= r; i++) mask[i] |= 1 << h;
if (l != m) build(l, m, h + 1);
if (m + 1 != r) build(m + 1, r, h + 1);
}
void Init(int N, int A[])
{
n = N;
for (int i = 0; i < n; i++)
{
a[i] = A[i];
mask[i] = 0;
}
build(0, n - 1, 0);
}
int Query(int L, int R) {
int a = 0, b = n - 1, h = 0;
while (a != b) {
int mid = (a + b) / 2;
if (mid >= L && mid < R)
return Secret(suf[L][h], pref[R][h]);
else if (mid == R) return suf[L][h];
else if (mid < L) a = mid + 1;
else b = mid;
h++;
}
return suf[a][h];
}
//coded by icyalmond
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |