oj.uz

Submission #549712

# Submission time Handle Problem Language Result Execution time Memory
549712 2022-04-16T10:54:19 Z colossal_pepe Secret (JOI14_secret) C++17
6 / 100
 8502 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[L];
    for (int i = L + 1; i <= R; i++) {
        ans = Secret(ans, a[i]);
    }
    return ans;
}

Subtask #1
6.0 / 100.0

# Verdict Execution time Memory Grader output
1 Partially correct 1641 ms 2428 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 1633 ms 2432 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 1643 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 3499 ms 4352 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 3547 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 486 ms 4244 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 8502 ms 4344 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 8087 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 7617 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 7652 ms 4336 KB Output isn't correct - number of calls to Secret by Init = 0, maximum number of calls to Secret by Query = 999