#include "secret.h"
#include <bits/stdc++.h>
using namespace std;
using i64 = long long;
const i64 MOD = 1e9 + 7;
const int MAXN = 1e3 + 5;
int N;
int a[MAXN];
int sum[MAXN][MAXN];
void Init(int N, int A[]) {
for(int i = 1; i <= N; i++) {
sum[i][i] = a[i];
for(int j = i + 1; j <= N; j++) {
sum[i][j] = Secret(sum[i][j - 1], a[j]);
}
}
}
int Query(int L, int R) {
return sum[L][R];
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
87 ms |
6828 KB |
Wrong Answer: Query(222, 254) - expected : 34031541, actual : 536870912. |
2 |
Incorrect |
93 ms |
6736 KB |
Wrong Answer: Query(60, 375) - expected : 669221184, actual : 0. |
3 |
Incorrect |
83 ms |
6592 KB |
Wrong Answer: Query(211, 401) - expected : 674373968, actual : 536870912. |
4 |
Incorrect |
326 ms |
8272 KB |
Wrong Answer: Query(90, 497) - expected : 397934825, actual : 536870912. |
5 |
Incorrect |
341 ms |
8532 KB |
Wrong Answer: Query(587, 915) - expected : 752404486, actual : 536870912. |
6 |
Incorrect |
330 ms |
8368 KB |
Wrong Answer: Query(915, 915) - expected : 282904741, actual : 0. |
7 |
Incorrect |
346 ms |
8272 KB |
Wrong Answer: Query(84, 976) - expected : 742463504, actual : 0. |
8 |
Incorrect |
326 ms |
8276 KB |
Wrong Answer: Query(58, 987) - expected : 20022464, actual : 536870912. |
9 |
Incorrect |
331 ms |
8528 KB |
Wrong Answer: Query(33, 967) - expected : 676869696, actual : 0. |
10 |
Incorrect |
343 ms |
8364 KB |
Wrong Answer: Query(116, 961) - expected : 68487362, actual : 0. |