#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++){
pref[i][i] = A[i];
}
build(0, N - 1);
// for (int i = 0; i < N; i++){
// for (int j = i; j < N; j++){
// cout << i << " " << j << " " << sg[i][j] << "\n";
// }
// }
}
int Query(int L, int R) {
if (pref[L][R]) return pref[L][R];
int mid = sg[L][R];
return Secret(pref[L][mid], pref[mid + 1][R]);
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
128 ms |
6340 KB |
Wrong Answer: Query(113, 206) - expected : 536899947, actual : 538256673. |
2 |
Incorrect |
128 ms |
6348 KB |
Wrong Answer: Query(60, 375) - expected : 669221184, actual : 311474560. |
3 |
Incorrect |
126 ms |
6400 KB |
Wrong Answer: Query(211, 401) - expected : 674373968, actual : 353554500. |
4 |
Incorrect |
522 ms |
12156 KB |
Wrong Answer: Query(90, 497) - expected : 397934825, actual : 343081568. |
5 |
Incorrect |
466 ms |
12140 KB |
Wrong Answer: Query(587, 915) - expected : 752404486, actual : 957013316. |
6 |
Incorrect |
470 ms |
12080 KB |
Wrong Answer: Query(738, 741) - expected : 983692994, actual : 536870912. |
7 |
Incorrect |
477 ms |
12064 KB |
Wrong Answer: Query(84, 976) - expected : 742463504, actual : 675449873. |
8 |
Incorrect |
457 ms |
12052 KB |
Wrong Answer: Query(58, 987) - expected : 20022464, actual : 273091792. |
9 |
Incorrect |
434 ms |
12084 KB |
Wrong Answer: Query(33, 967) - expected : 676869696, actual : 827853577. |
10 |
Incorrect |
443 ms |
12144 KB |
Wrong Answer: Query(116, 961) - expected : 68487362, actual : 337854787. |