#include "secret.h"
int n, pref[1005][15], suf[1005][15], a[1005], mask[1005];
void build(int l, int r, int h)
{
if (l == r) return;
int m = l + r >> 1;
suf[m][h] = a[m];
for (int i = m - 1; i >= l; i--) suf[i][h] = Secret(suf[i + 1][h], a[i]);
pref[m + 1][h] = a[m + 1];
for (int i = m + 2; i <= r; i++) pref[i][h] = Secret(pref[i - 1][h], a[i]);
for (int i = m + 1; i <= r; i++) mask[i] |= 1 << h;
if (l < m) build(l, m, h + 1);
if (m + 1 < r) build(m + 1, r, h + 1);
}
void Init(int N, int A[])
{
n = N;
for (int i = 0; i < n; i++)
{
a[i] = A[i];
mask[i] = 0;
}
build(0, n - 1, 0);
}
int Query(int L, int R)
{
if (L == R) return(a[L]);
else
{
int l = 0, r = n - 1, h = 0;
while (l < r)
{
int m = l + r >> 1;
if (L <= m && m + 1 <= R) return(Secret(suf[L][h], pref[R][h]));
else if (m + 1 > R)
{
r = m;
h++;
}
else if (L > m)
{
l = m + 1;
h++;
}
}
}
}
//coded by icyalmond
Compilation message
secret.cpp: In function 'void build(int, int, int)':
secret.cpp:8:15: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
8 | int m = l + r >> 1;
| ~~^~~
secret.cpp: In function 'int Query(int, int)':
secret.cpp:37:23: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
37 | int m = l + r >> 1;
| ~~^~~
secret.cpp:51:1: warning: control reaches end of non-void function [-Wreturn-type]
51 | }
| ^
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
100 ms |
3948 KB |
Wrong Answer: Query(222, 254) - expected : 34031541, actual : 268854015. |
2 |
Incorrect |
93 ms |
3664 KB |
Wrong Answer: Query(60, 375) - expected : 669221184, actual : 311474560. |
3 |
Incorrect |
97 ms |
2384 KB |
Wrong Answer: Query(211, 401) - expected : 674373968, actual : 353554500. |
4 |
Incorrect |
354 ms |
4456 KB |
Wrong Answer: Query(90, 497) - expected : 397934825, actual : 343081568. |
5 |
Incorrect |
349 ms |
4428 KB |
Wrong Answer: Query(587, 915) - expected : 752404486, actual : 957013316. |
6 |
Incorrect |
351 ms |
4676 KB |
Wrong Answer: Query(200, 208) - expected : 277813445, actual : 154975445. |
7 |
Incorrect |
350 ms |
4304 KB |
Wrong Answer: Query(84, 976) - expected : 742463504, actual : 675449873. |
8 |
Incorrect |
356 ms |
4692 KB |
Wrong Answer: Query(58, 987) - expected : 20022464, actual : 273091792. |
9 |
Incorrect |
356 ms |
4364 KB |
Wrong Answer: Query(33, 967) - expected : 676869696, actual : 827853577. |
10 |
Incorrect |
353 ms |
4696 KB |
Wrong Answer: Query(116, 961) - expected : 68487362, actual : 337854787. |