# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
703298 | bane | Secret (JOI14_secret) | C++17 | 497 ms | 8820 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 <bits/stdc++.h>
#include "secret.h"
using namespace std;
typedef long long ll;
const int MAX = 10005;
ll arr[MAX], ret[20][MAX], mask[MAX];
int n;
void init(int l, int r, int dep = 0){
if (l == r) return;
int m = l+(r-l)/2;
for (int i = m; i >= l; i--) ret[dep][i] = (i == m? arr[i] : Secret(arr[i], ret[dep][i+1]));
for (int i = m+1; i <= r; i++) ret[dep][i] = (i == m+1? arr[i] : Secret(arr[i], ret[dep][i-1]));
for (int i = m+1; i <= r; i++) mask[i] ^= (1<<dep);
init(l, m, dep+1); init(m+1, r, dep+1);
}
void Init(int N_, int A[]) {
n = N_;
for (int i = 0; i < n; ++i)arr[i] = A[i];
init(0,n-1,0);
}
int Query(int L, int R) {
int k = __builtin_clz(mask[L] ^ mask[R]);
return Secret(ret[k][L], ret[k][R]);
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |