#include "secret.h"
int *a;
int dat[18][1005]{0};
int mask[1005]{0};
void compute(int l, int r, int depth) {
if (l == r)
return;
int mid = (l + r) / 2;
dat[depth][mid] = a[mid];
for (int i = mid - 1; i >= l; i--)
dat[depth][i] = Secret(a[i], dat[depth][i + 1]);
dat[depth][mid + 1] = a[mid + 1];
for (int i = mid + 2; i <= r; i++)
dat[depth][i] = Secret(a[i], dat[depth][i - 1]);
for (int i = mid + 1; i <= r; i++) {
mask[i] ^= 1 << depth;
}
compute(l, mid, depth + 1);
compute(mid + 1, r, depth + 1);
}
void Init(int N, int A[]) {
a = A;
compute(0, N - 1, 0);
}
int Query(int L, int R) {
if (L == R)
return a[L];
int x = __builtin_ctz(mask[L] ^ mask[R]);
return Secret(dat[x][L], dat[x][R]);
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
112 ms |
2528 KB |
Wrong Answer: Query(222, 254) - expected : 34031541, actual : 809782271. |
2 |
Incorrect |
116 ms |
2364 KB |
Wrong Answer: Query(60, 375) - expected : 669221184, actual : 68749376. |
3 |
Incorrect |
114 ms |
2472 KB |
Wrong Answer: Query(211, 401) - expected : 674373968, actual : 136349820. |
4 |
Incorrect |
442 ms |
4308 KB |
Wrong Answer: Query(90, 497) - expected : 397934825, actual : 650789536. |
5 |
Incorrect |
449 ms |
4320 KB |
Wrong Answer: Query(587, 915) - expected : 752404486, actual : 377506838. |
6 |
Incorrect |
422 ms |
4532 KB |
Wrong Answer: Query(738, 741) - expected : 983692994, actual : 61461050. |
7 |
Incorrect |
459 ms |
4344 KB |
Wrong Answer: Query(84, 976) - expected : 742463504, actual : 687550570. |
8 |
Incorrect |
432 ms |
4276 KB |
Wrong Answer: Query(58, 987) - expected : 20022464, actual : 145923264. |
9 |
Incorrect |
441 ms |
4332 KB |
Wrong Answer: Query(33, 967) - expected : 676869696, actual : 18757135. |
10 |
Incorrect |
438 ms |
4308 KB |
Wrong Answer: Query(116, 961) - expected : 68487362, actual : 70590726. |