#include <secret.h>
using namespace std;
int n, a[1005];
void Init(int N, int A[]) {
n = N;
for (int i = 0; i < n; i++) {
a[i] = A[i];
}
}
int Query(int L, int R) {
int ans = a[R];
for (int i = R - 1; i >= L; i--) {
ans = Secret(ans, a[i]);
}
return ans;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
92 ms |
2252 KB |
Wrong Answer: Query(222, 254) - expected : 34031541, actual : 34607541. |
2 |
Incorrect |
93 ms |
2280 KB |
Wrong Answer: Query(60, 375) - expected : 669221184, actual : 795052233. |
3 |
Incorrect |
139 ms |
2336 KB |
Wrong Answer: Query(211, 401) - expected : 674373968, actual : 496080966. |
4 |
Incorrect |
422 ms |
4268 KB |
Wrong Answer: Query(90, 497) - expected : 397934825, actual : 339739196. |
5 |
Incorrect |
345 ms |
4148 KB |
Wrong Answer: Query(587, 915) - expected : 752404486, actual : 426810446. |
6 |
Incorrect |
351 ms |
4188 KB |
Wrong Answer: Query(738, 741) - expected : 983692994, actual : 850129153. |
7 |
Incorrect |
378 ms |
4204 KB |
Wrong Answer: Query(84, 976) - expected : 742463504, actual : 638095410. |
8 |
Incorrect |
349 ms |
4188 KB |
Wrong Answer: Query(58, 987) - expected : 20022464, actual : 426111120. |
9 |
Incorrect |
346 ms |
4156 KB |
Wrong Answer: Query(33, 967) - expected : 676869696, actual : 547103880. |
10 |
Incorrect |
348 ms |
4272 KB |
Wrong Answer: Query(116, 961) - expected : 68487362, actual : 604842184. |