# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
383885 | JerryLiu06 | Secret (JOI14_secret) | C++11 | 536 ms | 4460 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;
int dat[10][1010], mask[1010], A[1010];
void divide(int L, int R, int lev, int A[]) {
if (L == R) return ; int mid = (L + R) / 2;
dat[lev][mid] = A[mid]; for (int i = mid - 1; i >= L; i--) dat[lev][i] = Secret(A[i], dat[lev][i + 1]);
dat[lev][mid + 1] = A[mid + 1]; for (int i = mid + 2; i <= R; i++) dat[lev][i] = Secret(dat[lev][i - 1], A[i]);
for (int i = mid + 1; i <= R; i++) mask[i] ^= (1 << lev);
divide(L, mid, lev + 1, A); divide(mid + 1, R, lev + 1, A);
}
void Init(int N, int arr[]) { for (int i = 0; i < N; i++) A[i] = arr[i]; divide(0, N - 1, 0, A); }
int Query(int L, int R) { if (L == R) return A[L];
int lev = __builtin_ctz(mask[L] ^ mask[R]); return Secret(dat[lev][L], dat[lev][R]);
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |