| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1306866 | mncuchiinhuttt | 비밀 (JOI14_secret) | C++20 | 0 ms | 0 KiB |
#include "secret.h";
int n;
int dnc[N][N];
void go(int l, int r, int A[]) {
if (l == r) return;
int mid = (l + r) >> 1;
dnc[mid][mid] = A[mid];
dnc[mid + 1][mid + 1] = A[mid + 1];
dnc[mid][mid + 1] = Secret(A[mid], A[mid + 1]);
for (int i = mid - 1; i >= l; --i) {
dnc[i][mid] = Secret(dnc[i + 1][mid], A[i]);
}
for (int i = mid + 2; i <= r; ++i) {
dnc[mid + 1][i] = Secret(dnc[mid + 1][i - 1], A[i]);
}
go(l, mid, A);
go(mid + 1, r, A);
}
void Init(int N, int A[]) {
n = N;
go(0, n - 1, A);
}
int Query(int L, int R) {
int a = 0, b = n - 1;
while (a != b) {
int mid = (a + b) >> 1;
if (L <= mid and mid < R) {
return Secret(dnc[L][mid], dnc[mid + 1][R]);
} else if (mid == R) {
return dnc[mid][L];
} else if (mid < L) {
a = mid + 1;
} else {
b = mid;
}
}
return dnc[L][L];
}
