# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
794030 | acatmeowmeow | Secret (JOI14_secret) | C++11 | 389 ms | 4408 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"
#include <bits/stdc++.h>
using namespace std;
const int N = 1e3;
int arr[N + 5], dat[15][N + 5], mask[N + 5];
void build(int level, int l, int r) {
if (l == r) return;
int m = (l + r)/2;
dat[level][m] = arr[m];
for (int i = m - 1; i >= l; i--) dat[level][i] = Secret(arr[i], dat[level][i + 1]);
dat[level][m + 1] = arr[m + 1];
for (int i = m + 2; i <= r; i++) dat[level][i] = Secret(dat[level][i - 1], arr[i]);
for (int i = m + 1; i <= r; i++) mask[i] ^= (1ll << level);
build(level + 1, l, m);
build(level + 1, m + 1, r);
}
void Init(int N, int A[]) {
for (int i = 0; i < N; i++) arr[i] = A[i];
build(0, 0, N - 1);
}
int Query(int L, int R) {
if (L == R) return arr[L];
int level = __builtin_ctzll(mask[L] ^ mask[R]);
return Secret(dat[level][L], dat[level][R]);
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |