#include "secret.h"
int n, pref[1000][1000];
void precompute(int l, int r, int A[]) {
int mid = l + r >> 1;
pref[mid][mid] = A[mid];
pref[mid+1][mid+1] = A[mid+1];
for (int i = mid - 1; i >= l; i--) {
pref[mid][i] = Secret(pref[mid][i+1], A[i]);
}
for (int i = mid + 2; i <= r; i++) {
pref[mid+1][i] = Secret(pref[mid+1][i-1], A[i]);
}
if (l < mid) {
precompute(l, mid, A);
}
if (mid + 1 < r) {
precompute(mid + 1, r, A);
}
}
void Init(int N, int A[]) {
n = N;
precompute(0, N - 1, A);
}
int Query(int L, int R) {
int lo = 0, hi = n - 1;
while (lo != hi) {
int mid = lo + hi >> 1;
if (L <= mid && mid < R) {
return Secret(pref[mid][L], pref[mid+1][R]);
}
if (R == mid) {
return pref[mid][L];
}
if (mid < L) {
lo = mid + 1;
} else {
hi = mid;
}
}
return pref[lo][lo];
}
Compilation message
secret.cpp: In function 'void precompute(int, int, int*)':
secret.cpp:4:14: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
4 | int mid = l + r >> 1;
| ~~^~~
secret.cpp: In function 'int Query(int, int)':
secret.cpp:27:16: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
27 | int mid = lo + hi >> 1;
| ~~~^~~~
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
119 ms |
4256 KB |
Wrong Answer: Query(222, 254) - expected : 34031541, actual : 268854015. |
2 |
Incorrect |
123 ms |
4332 KB |
Wrong Answer: Query(60, 375) - expected : 669221184, actual : 311474560. |
3 |
Incorrect |
124 ms |
4296 KB |
Wrong Answer: Query(211, 401) - expected : 674373968, actual : 353554500. |
4 |
Incorrect |
424 ms |
8164 KB |
Wrong Answer: Query(90, 497) - expected : 397934825, actual : 343081568. |
5 |
Incorrect |
431 ms |
8116 KB |
Wrong Answer: Query(587, 915) - expected : 752404486, actual : 957013316. |
6 |
Incorrect |
416 ms |
8140 KB |
Wrong Answer: Query(200, 208) - expected : 277813445, actual : 154975445. |
7 |
Incorrect |
428 ms |
8060 KB |
Wrong Answer: Query(84, 976) - expected : 742463504, actual : 675449873. |
8 |
Incorrect |
423 ms |
8140 KB |
Wrong Answer: Query(58, 987) - expected : 20022464, actual : 273091792. |
9 |
Incorrect |
420 ms |
8100 KB |
Wrong Answer: Query(33, 967) - expected : 676869696, actual : 827853577. |
10 |
Incorrect |
414 ms |
8100 KB |
Wrong Answer: Query(116, 961) - expected : 68487362, actual : 337854787. |