#include "secret.h"
#include <bits/stdc++.h>
const int MX = 1001;
int tab[13][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];
tab[level][m+1] = a[m+1];
for(int i=m-1; i>=l; --i) {
tab[level][i] = Secret(a[i], tab[level][i+1]);
}
for(int i=m+2; i<=r; ++i) {
tab[level][i] = Secret(a[i], tab[level][i-1]);
}
for(int i=m+1; i<=r; ++i) {
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]);
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
120 ms |
2372 KB |
Wrong Answer: Query(222, 254) - expected : 34031541, actual : 809782271. |
2 |
Incorrect |
116 ms |
2380 KB |
Wrong Answer: Query(60, 375) - expected : 669221184, actual : 68749376. |
3 |
Incorrect |
115 ms |
2368 KB |
Wrong Answer: Query(211, 401) - expected : 674373968, actual : 136349820. |
4 |
Incorrect |
423 ms |
4248 KB |
Wrong Answer: Query(90, 497) - expected : 397934825, actual : 650789536. |
5 |
Incorrect |
432 ms |
4280 KB |
Wrong Answer: Query(587, 915) - expected : 752404486, actual : 377506838. |
6 |
Incorrect |
436 ms |
4364 KB |
Wrong Answer: Query(738, 741) - expected : 983692994, actual : 61461050. |
7 |
Incorrect |
420 ms |
4264 KB |
Wrong Answer: Query(84, 976) - expected : 742463504, actual : 687550570. |
8 |
Incorrect |
442 ms |
4268 KB |
Wrong Answer: Query(58, 987) - expected : 20022464, actual : 145923264. |
9 |
Incorrect |
446 ms |
4320 KB |
Wrong Answer: Query(33, 967) - expected : 676869696, actual : 18757135. |
10 |
Incorrect |
450 ms |
4308 KB |
Wrong Answer: Query(116, 961) - expected : 68487362, actual : 70590726. |