#include <bits/stdc++.h>
#include "secret.h"
using namespace std;
const int maxn = 1001;
int pref [maxn][maxn];
int sg [maxn][maxn];
void build (int l, int r) {
if (l >= r) return;
int mid = (l + r) / 2;
for (int i = mid - 1; i >= l; i--){
for (int j = mid + 1; j < r; j++){
sg[i][j] = mid;
}
}
for (int i = mid + 2; i < r; i++){
pref[mid + 1][i] = Secret(pref[mid + 1][i-1], pref[i][i]);
}
for (int i = mid - 1; i >= l; i--){
pref[i][mid] = Secret(pref[i + 1][mid], pref[i][i]);
}
build (l, mid);
build (mid + 1, r);
}
void Init(int N, int A[]) {
for (int i = 0; i < N; i++){
for (int j = 0; j < N; j++) {
pref[i][j] = -1;
}
}
for (int i = 0; i < N; i++){
pref[i][i] = A[i];
}
build(0, N);
}
int Query(int L, int R) {
if (pref[L][R] != -1) return pref[L][R];
int mid = sg[L][R];
return Secret(pref[L][mid], pref[mid + 1][R]);
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
116 ms |
6296 KB |
Wrong Answer: Query(222, 254) - expected : 34031541, actual : 268854015. |
2 |
Incorrect |
115 ms |
6268 KB |
Wrong Answer: Query(60, 375) - expected : 669221184, actual : 747241792. |
3 |
Incorrect |
121 ms |
6260 KB |
Wrong Answer: Query(211, 401) - expected : 674373968, actual : 353554500. |
4 |
Incorrect |
432 ms |
12064 KB |
Wrong Answer: Query(90, 497) - expected : 397934825, actual : 343081568. |
5 |
Incorrect |
469 ms |
12060 KB |
Wrong Answer: Query(587, 915) - expected : 752404486, actual : 497583184. |
6 |
Incorrect |
442 ms |
12060 KB |
Wrong Answer: Query(738, 741) - expected : 983692994, actual : 993621889. |
7 |
Incorrect |
451 ms |
12048 KB |
Wrong Answer: Query(84, 976) - expected : 742463504, actual : 657493000. |
8 |
Incorrect |
441 ms |
12028 KB |
Wrong Answer: Query(58, 987) - expected : 20022464, actual : 764569728. |
9 |
Incorrect |
479 ms |
11964 KB |
Wrong Answer: Query(33, 967) - expected : 676869696, actual : 277877441. |
10 |
Incorrect |
451 ms |
12020 KB |
Wrong Answer: Query(116, 961) - expected : 68487362, actual : 69725386. |