oj.uz

Submission #774487

# Submission time Handle Problem Language Result Execution time Memory
774487 2023-07-05T18:45:43 Z colossal_pepe Secret (JOI14_secret) C++17
6 / 100
 6474 ms 4352 KB 
#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(a[i], ans);
    }
    return ans;
}

Subtask #1
6.0 / 100.0

# Verdict Execution time Memory Grader output
1 Partially correct 1254 ms 2548 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 1235 ms 2552 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 1248 ms 2440 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 2655 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 2672 ms 4348 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 374 ms 4352 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 6474 ms 4340 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 6210 ms 4336 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 6215 ms 4340 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 6242 ms 4260 KB Output isn't correct - number of calls to Secret by Init = 0, maximum number of calls to Secret by Query = 999