# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
988095 | icyalmond | Secret (JOI14_secret) | C++17 | 0 ms | 0 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 = 1; i <= n; i++)
{
a[i] = A[i - 1];
mask[i] = 0;
}
build(1, n, 0);
}
int Query(int L, int R)
{
if (L == R) return(a[L + 1]);
else
{
L++; R++;
int l = 1, r = n, h = 0;
while (l <= r)
{
int m = l + r >> 1;
if (L <= m && m + 1 <= R) return(Secret(suf[L][h], pref{R][h]));
else if (R <= m)
{
r = m;
h++;
}
else if (m + 1 <= L)
{
l = m + 1;
h++;
}
}
}
}
//coded by icyalmond