#include "secret.h"
int n, pref[1005][15], suf[1005][15], a[1005], mask[1005];
void build(int l, int r, int h)
{
int m = l + 1 >> 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) {
int a = 0, b = n - 1, h = 0;
while (a != b) {
int mid = (a + b) / 2;
if (mid >= L && mid < R)
return Secret(suf[L][h], pref[R][h]);
else if (mid == R) return suf[L][h];
else if (mid < L) a = mid + 1;
else b = mid;
h++;
}
return suf[a][h];
}
//coded by icyalmond
Compilation message
secret.cpp: In function 'void build(int, int, int)':
secret.cpp:7:15: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
7 | int m = l + 1 >> 1;
| ~~^~~
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Runtime error |
99 ms |
10576 KB |
Execution killed with signal 11 |
2 |
Runtime error |
100 ms |
10764 KB |
Execution killed with signal 11 |
3 |
Runtime error |
101 ms |
10580 KB |
Execution killed with signal 11 |
4 |
Runtime error |
371 ms |
12096 KB |
Execution killed with signal 11 |
5 |
Runtime error |
359 ms |
12052 KB |
Execution killed with signal 11 |
6 |
Runtime error |
358 ms |
12204 KB |
Execution killed with signal 11 |
7 |
Runtime error |
364 ms |
12152 KB |
Execution killed with signal 11 |
8 |
Runtime error |
358 ms |
12132 KB |
Execution killed with signal 11 |
9 |
Runtime error |
356 ms |
12192 KB |
Execution killed with signal 11 |
10 |
Runtime error |
363 ms |
12108 KB |
Execution killed with signal 11 |