#include "secret.h"
#include <bits/stdc++.h>
const int MX = 1001;
int tab[10][MX];
int mask[MX];
int n, a[MX];
void prepare(int l, int r, int level) {
if(l==r) return;
int m = (l+r)/2;
tab[level][m] = a[m];
for(int i=m-1; i>=l; --i) {
tab[level][i] = Secret(a[i], tab[level][i+1]);
}
for(int i=m+1; i<=r; ++i) {
tab[level][i] = Secret(a[i], tab[level][i-1]);
mask[i] ^= 1<<level;
}
prepare(l, m, level+1);
prepare(m+1, r, level+1);
}
void Init(int N, int A[]) {
n = N;
for(int i=0; i<n; ++i) {
a[i] = A[i];
}
prepare(0, n-1, 0);
}
int Query(int L, int R) {
if(L==R) return a[L];
int level = __builtin_ctz(mask[L]^mask[R]);
return Secret(tab[level][L], tab[level][R]);
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
129 ms |
2372 KB |
Wrong Answer: Query(222, 254) - expected : 34031541, actual : 822244391. |
2 |
Incorrect |
115 ms |
2336 KB |
Wrong Answer: Query(60, 375) - expected : 669221184, actual : 179341377. |
3 |
Incorrect |
120 ms |
2308 KB |
Wrong Answer: Query(211, 401) - expected : 674373968, actual : 681674848. |
4 |
Incorrect |
455 ms |
4264 KB |
Wrong Answer: Query(90, 497) - expected : 397934825, actual : 290587207. |
5 |
Incorrect |
432 ms |
4260 KB |
Wrong Answer: Query(587, 915) - expected : 752404486, actual : 907575628. |
6 |
Incorrect |
453 ms |
4288 KB |
Wrong Answer: Query(738, 741) - expected : 983692994, actual : 302773097. |
7 |
Incorrect |
441 ms |
4196 KB |
Wrong Answer: Query(84, 976) - expected : 742463504, actual : 124256330. |
8 |
Incorrect |
449 ms |
4212 KB |
Wrong Answer: Query(58, 987) - expected : 20022464, actual : 431038472. |
9 |
Incorrect |
472 ms |
4224 KB |
Wrong Answer: Query(33, 967) - expected : 676869696, actual : 679881604. |
10 |
Incorrect |
433 ms |
4396 KB |
Wrong Answer: Query(116, 961) - expected : 68487362, actual : 543009546. |