#include "secret.h"
#include <bits/stdc++.h>
using namespace std;
int MX_lv = 20;
int n;
vector<int> arr;
vector<vector<vector<int>>> dat;
void divi(int l, int r, int level) {
if (l == r) return;
int mid = (l + r) / 2;
dat[mid][level][0] = arr[mid];
dat[mid + 1][level][1] = arr[mid + 1];
for (int i = mid - 1; i >= l; i--) {
dat[i][level][0] = Secret(arr[i], dat[i + 1][level][0]);
}
for (int i = mid + 2; i <= r; i++) {
dat[i][level][1] = Secret(arr[i], dat[i - 1][level][1]);
}
divi(l, mid, level + 1);
divi(mid + 1, r, level + 1);
}
void Init(int N, int A[]) {
n = N;
arr.resize(n);
dat = vector<vector<vector<int>>>(N, vector<vector<int>>(MX_lv, vector<int>(2)));
for (int i = 0; i < n; i++) {
arr[i] = A[i];
}
divi(0, n - 1, 0);
}
int Query(int L, int R) { // do something
if (L == R) return arr[L];
// now somehow figure out the level -> binary search
int hi = n - 1, lo = 0;
int lv = 0;
while (hi >= lo) {
int mid = (hi + lo) / 2;
if (L <= mid && mid < R) {
// we found it yay
return Secret(dat[L][lv][0], dat[R][lv][1]);
} else if (R <= mid) {
hi = mid - 1;
} else {
lo = mid + 1;
}
lv++;
}
assert(0);
return 0;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
130 ms |
2924 KB |
Wrong Answer: Query(222, 254) - expected : 34031541, actual : 809782271. |
2 |
Incorrect |
120 ms |
2968 KB |
Wrong Answer: Query(60, 375) - expected : 669221184, actual : 68749376. |
3 |
Incorrect |
141 ms |
3008 KB |
Wrong Answer: Query(211, 401) - expected : 674373968, actual : 136349820. |
4 |
Incorrect |
438 ms |
5440 KB |
Wrong Answer: Query(90, 497) - expected : 397934825, actual : 650789536. |
5 |
Incorrect |
480 ms |
5448 KB |
Wrong Answer: Query(587, 915) - expected : 752404486, actual : 377506838. |
6 |
Incorrect |
457 ms |
5392 KB |
Wrong Answer: Query(738, 741) - expected : 983692994, actual : 950174288. |
7 |
Incorrect |
458 ms |
5564 KB |
Wrong Answer: Query(84, 976) - expected : 742463504, actual : 687550570. |
8 |
Incorrect |
460 ms |
5464 KB |
Wrong Answer: Query(58, 987) - expected : 20022464, actual : 145923264. |
9 |
Incorrect |
447 ms |
5416 KB |
Wrong Answer: Query(33, 967) - expected : 676869696, actual : 18757135. |
10 |
Incorrect |
440 ms |
5492 KB |
Wrong Answer: Query(116, 961) - expected : 68487362, actual : 70590726. |