# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
6980 | tncks0121 | Secret (JOI14_secret) | C++98 | 686 ms | 5148 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 precalc[10][1000];
void Init (int N, int A[]) {
for(int i = 0; i < N; i++) precalc[0][i] = A[i];
for(int k = 1; (1<<k) < N; k++) {
for(int i = 0; i <= N - (1<<k); i++) precalc[k][i] = Secret(precalc[k-1][i], precalc[k-1][i + (1<<(k-1))]);
}
}
int Query(int L, int R) {
int len = (R - L + 1);
int ret = -1;
for(int k = 0; k < 10; k++) if((len >> k) & 1) {
if(ret < 0) ret = precalc[k][L];
else ret = Secret(ret, precalc[k][L]);
L += 1<<k;
}
return ret;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |