# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
988092 |
2024-05-24T04:39:32 Z |
icyalmond |
Secret (JOI14_secret) |
C++17 |
|
398 ms |
12440 KB |
#include "secret.h"
#include <bits/stdc++.h>
using namespace std;
long long 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[])
{
for (int i = 1; i <= N; i++)
{
a[i] = A[i - 1];
mask[i] = 0;
}
build(1, N, 0);
}
int Query(int L, int R)
{
if (L == R) return(a[L + 1]);
else
{
int h = __builtin_ctz(mask[L + 1] ^ mask[R + 1]);
return(Secret(suf[L + 1][h], pref[R + 1][h]));
}
}
//coded by icyalmond
Compilation message
secret.cpp: In function 'void build(int, int, int)':
secret.cpp:9:15: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
9 | int m = l + 1 >> 1;
| ~~^~~
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
108 ms |
8876 KB |
Execution killed with signal 11 |
2 |
Runtime error |
104 ms |
8828 KB |
Execution killed with signal 11 |
3 |
Runtime error |
105 ms |
9044 KB |
Execution killed with signal 11 |
4 |
Runtime error |
379 ms |
12248 KB |
Execution killed with signal 11 |
5 |
Runtime error |
374 ms |
12368 KB |
Execution killed with signal 11 |
6 |
Runtime error |
381 ms |
12340 KB |
Execution killed with signal 11 |
7 |
Runtime error |
375 ms |
12368 KB |
Execution killed with signal 11 |
8 |
Runtime error |
384 ms |
12440 KB |
Execution killed with signal 11 |
9 |
Runtime error |
376 ms |
12368 KB |
Execution killed with signal 11 |
10 |
Runtime error |
398 ms |
12312 KB |
Execution killed with signal 11 |