#include "secret.h"
#include<bits/stdc++.h>
using namespace std;
int n, a[1005], arr[1005][1005];
void calc(int l, int r) {
if (l == r) {
arr[l][l] = a[l];
return;
}
int m = (l+r)/2;
arr[m][m] = a[m];
arr[m+1][m+1] = a[m+1];
for (int i = m-1; i >= l; i--) {
arr[m][i] = Secret(a[i], arr[m][i+1]);
}
for (int i = m+2; i <= r; i++) {
arr[m+1][i] = Secret(a[i], arr[m+1][i-1]);
}
calc(l, m);
calc(m+1, r);
}
void Init(int N, int A[]) {
n = N;
for (int i = 0; i < n; i++) {
a[i] = A[i];
}
calc(0, n-1);
}
int Query(int L, int R) {
int l = 0, r = n-1;
while(l < r) {
int m = (l+r)/2;
if (L <= m && m < R) {
return Secret(arr[m][L], arr[m+1][R]);
} else if (R == m) {
return arr[m][L];
} else if (R < m) {
r = m;
} else {
l = m+1;
}
}
return arr[l][l];
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
66 ms |
6744 KB |
Wrong Answer: Query(222, 254) - expected : 34031541, actual : 809782271. |
2 |
Incorrect |
66 ms |
6736 KB |
Wrong Answer: Query(60, 375) - expected : 669221184, actual : 68749376. |
3 |
Incorrect |
66 ms |
6604 KB |
Wrong Answer: Query(211, 401) - expected : 674373968, actual : 136349820. |
4 |
Incorrect |
251 ms |
8296 KB |
Wrong Answer: Query(90, 497) - expected : 397934825, actual : 650789536. |
5 |
Incorrect |
275 ms |
8288 KB |
Wrong Answer: Query(587, 915) - expected : 752404486, actual : 377506838. |
6 |
Incorrect |
268 ms |
8272 KB |
Wrong Answer: Query(738, 741) - expected : 983692994, actual : 61461050. |
7 |
Incorrect |
254 ms |
8272 KB |
Wrong Answer: Query(84, 976) - expected : 742463504, actual : 687550570. |
8 |
Incorrect |
256 ms |
8276 KB |
Wrong Answer: Query(58, 987) - expected : 20022464, actual : 145923264. |
9 |
Incorrect |
252 ms |
8184 KB |
Wrong Answer: Query(33, 967) - expected : 676869696, actual : 18757135. |
10 |
Incorrect |
271 ms |
8256 KB |
Wrong Answer: Query(116, 961) - expected : 68487362, actual : 70590726. |