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