#include "secret.h"
int v[1005][1005];
void solve(int l, int r) {
if (l >= r)
return ;
int med = (l + r) / 2;
solve(l, med);
solve(med + 1, r);
for (int i = med - 1; i >= 1; --i)
v[i][med] = Secret(v[i][i], v[i + 1][med]);
for (int i = med + 2; i <= r; ++i)
v[med + 1][i] = Secret(v[i][i], v[med + 1][i - 1]);
}
void Init(int N, int A[]) {
for (int i = 0; i < N; ++i)
for (int j = 0; j < N; ++j)
v[i][j] = -1;
for (int i = 0; i < N; ++i)
v[i][i] = 1;
solve(0, N - 1);
}
int Query(int L, int R) {
if (L == R)
return v[L][L];
if (R == L + 1)
return Secret(v[L][L], v[R][R]);
for (int k = L; k < R; ++k)
if (v[L][k] != -1 && v[k + 1][R] != -1)
return Secret(v[L][k], v[k + 1][R]);
return 0;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
229 ms |
4444 KB |
Wrong Answer: Query(222, 254) - expected : 34031541, actual : 536870913. |
2 |
Incorrect |
222 ms |
4544 KB |
Wrong Answer: Query(60, 375) - expected : 669221184, actual : 0. |
3 |
Incorrect |
221 ms |
4612 KB |
Wrong Answer: Query(211, 401) - expected : 674373968, actual : 1. |
4 |
Incorrect |
846 ms |
8636 KB |
Wrong Answer: Query(90, 497) - expected : 397934825, actual : 536870912. |
5 |
Incorrect |
801 ms |
8636 KB |
Wrong Answer: Query(587, 915) - expected : 752404486, actual : 536870913. |
6 |
Incorrect |
814 ms |
8636 KB |
Wrong Answer: Query(915, 915) - expected : 282904741, actual : 1. |
7 |
Incorrect |
834 ms |
8636 KB |
Wrong Answer: Query(84, 976) - expected : 742463504, actual : 1. |
8 |
Incorrect |
823 ms |
8636 KB |
Wrong Answer: Query(58, 987) - expected : 20022464, actual : 536870913. |
9 |
Incorrect |
868 ms |
8636 KB |
Wrong Answer: Query(33, 967) - expected : 676869696, actual : 262145. |
10 |
Incorrect |
843 ms |
8636 KB |
Wrong Answer: Query(116, 961) - expected : 68487362, actual : 808534657. |