//#include <bits/stdc++.h>
#include "secret.h"
using namespace std;
const int N = 1e3 + 10;
int n;
int a[N], f[N][N];
void prepare(int l, int r) {
if (l == r) {
return;
}
int m = (l + r) / 2;
f[m][m] = a[m];
f[m + 1][m + 1] = a[m + 1];
for (int j = m + 2; j <= r; j++) {
f[m + 1][j] = Secret(f[m + 1][j - 1], a[j]);
}
for (int j = m - 1; j >= l; j--) {
f[j][m] = Secret(f[j + 1][m], a[j]);
}
prepare(l, m);
prepare(m + 1, r);
}
void Init(int _n, int _a[]) {
n = _n;
for (int i = 1; i <= n; i++)
a[i] = _a[i - 1];
prepare(1, n);
}
int get(int l, int r, int u, int v) {
int m = (l + r) / 2;
if (m < u)
return get(m + 1, r, u, v);
if (m >= v)
return get(l, m, u, v);
return Secret(f[u][m], f[m + 1][v]);
}
int Query(int l, int r) {
l++, r++;
if (l == r) {
return a[l];
}
return get(1, n, l, r);
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
104 ms |
7504 KB |
Wrong Answer: Query(113, 206) - expected : 536899947, actual : 538256673. |
2 |
Incorrect |
94 ms |
7548 KB |
Wrong Answer: Query(60, 375) - expected : 669221184, actual : 311474560. |
3 |
Incorrect |
99 ms |
7544 KB |
Wrong Answer: Query(211, 401) - expected : 674373968, actual : 353554500. |
4 |
Incorrect |
350 ms |
8272 KB |
Wrong Answer: Query(90, 497) - expected : 397934825, actual : 343081568. |
5 |
Incorrect |
367 ms |
8452 KB |
Wrong Answer: Query(587, 915) - expected : 752404486, actual : 957013316. |
6 |
Incorrect |
355 ms |
8276 KB |
Wrong Answer: Query(747, 749) - expected : 244228265, actual : 935077363. |
7 |
Incorrect |
354 ms |
8400 KB |
Wrong Answer: Query(84, 976) - expected : 742463504, actual : 675449873. |
8 |
Incorrect |
359 ms |
8276 KB |
Wrong Answer: Query(58, 987) - expected : 20022464, actual : 273091792. |
9 |
Incorrect |
363 ms |
8208 KB |
Wrong Answer: Query(33, 967) - expected : 676869696, actual : 827853577. |
10 |
Incorrect |
352 ms |
8200 KB |
Wrong Answer: Query(116, 961) - expected : 68487362, actual : 337854787. |