# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
988087 |
2024-05-24T04:29:04 Z |
icyalmond |
Secret (JOI14_secret) |
C++14 |
|
373 ms |
12884 KB |
#include "secret.h"
int pref[1005][15], suf[1005][15], mask[1005];
void build(int l, int r, int h, int A[])
{
int m = l + 1 >> 1;
suf[m][h] = A[m - 1];
for (int i = m - 1; i >= l; i--) suf[i][h] = Secret(suf[i + 1][h], A[i - 1]);
pref[m + 1][h] = A[m];
for (int i = m + 2; i <= r; i++) pref[i][h] = Secret(pref[i - 1][h], A[i - 1]);
for (int i = m + 1; i <= r; i++) mask[i] |= 1 << h;
if (l != m) build(l, m, h + 1, A);
if (m + 1 != r) build(m + 1, r, h + 1, A);
}
void Init(int N, int A[])
{
build(1, N, 0, A);
}
int Query(int L, int R)
{
int h = __builtin_ctz(mask[L + 1] ^ mask[R + 1]);
if (L == R) return(suf[L + 1][h]);
else return(Secret(suf[L + 1][h], pref[R + 1][h]));
}
//coded by icyalmond
Compilation message
secret.cpp: In function 'void build(int, int, int, int*)':
secret.cpp:7:15: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
7 | int m = l + 1 >> 1;
| ~~^~~
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
100 ms |
11156 KB |
Execution killed with signal 11 |
2 |
Runtime error |
103 ms |
11060 KB |
Execution killed with signal 11 |
3 |
Runtime error |
101 ms |
11088 KB |
Execution killed with signal 11 |
4 |
Runtime error |
369 ms |
12756 KB |
Execution killed with signal 11 |
5 |
Runtime error |
352 ms |
12728 KB |
Execution killed with signal 11 |
6 |
Runtime error |
373 ms |
12728 KB |
Execution killed with signal 11 |
7 |
Runtime error |
355 ms |
12728 KB |
Execution killed with signal 11 |
8 |
Runtime error |
360 ms |
12884 KB |
Execution killed with signal 11 |
9 |
Runtime error |
354 ms |
12624 KB |
Execution killed with signal 11 |
10 |
Runtime error |
356 ms |
12608 KB |
Execution killed with signal 11 |