#include <secret.h>
using namespace std;
int n, a[2005];
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) {
if (L == R) return a[L];
int ans = Secret(a[L], a[L + 1]);
for (int i = L + 2; i <= R; i++) {
ans = Secret(ans, a[i]);
}
return ans;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Partially correct |
1489 ms |
2424 KB |
Output isn't correct - number of calls to Secret by Init = 0, maximum number of calls to Secret by Query = 506 |
2 |
Partially correct |
1501 ms |
2424 KB |
Output isn't correct - number of calls to Secret by Init = 0, maximum number of calls to Secret by Query = 508 |
3 |
Partially correct |
1509 ms |
2432 KB |
Output isn't correct - number of calls to Secret by Init = 0, maximum number of calls to Secret by Query = 505 |
4 |
Partially correct |
3094 ms |
4344 KB |
Output isn't correct - number of calls to Secret by Init = 0, maximum number of calls to Secret by Query = 997 |
5 |
Partially correct |
3151 ms |
4392 KB |
Output isn't correct - number of calls to Secret by Init = 0, maximum number of calls to Secret by Query = 992 |
6 |
Partially correct |
449 ms |
4292 KB |
Output is partially correct - number of calls to Secret by Init = 0, maximum number of calls to Secret by Query = 10 |
7 |
Partially correct |
7948 ms |
4336 KB |
Output isn't correct - number of calls to Secret by Init = 0, maximum number of calls to Secret by Query = 999 |
8 |
Partially correct |
7523 ms |
4332 KB |
Output isn't correct - number of calls to Secret by Init = 0, maximum number of calls to Secret by Query = 999 |
9 |
Partially correct |
7549 ms |
4332 KB |
Output isn't correct - number of calls to Secret by Init = 0, maximum number of calls to Secret by Query = 998 |
10 |
Partially correct |
7573 ms |
4336 KB |
Output isn't correct - number of calls to Secret by Init = 0, maximum number of calls to Secret by Query = 999 |