oj.uz

Submission #636533

# Submission time Handle Problem Language Result Execution time Memory
636533 2022-08-29T13:26:44 Z JooDdae Secret (JOI14_secret) C++17
6 / 100
 7833 ms 4396 KB 
#include "secret.h"
#include <bits/stdc++.h>
using namespace std;
int n, a[1010];
void Init(int N, int A[]) {
    n = N;
    for(int i=1;i<=n;i++) a[i] = A[i-1];
}
int Query(int L, int R) {
    int re = a[L+1];
    for(int i=L+1;i<=R;i++) re = Secret(re, a[i+1]);
    return re;
}

Subtask #1
6.0 / 100.0

# Verdict Execution time Memory Grader output
1 Partially correct 1498 ms 2368 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 1474 ms 2380 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 1533 ms 2376 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 3117 ms 4396 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 3191 ms 4376 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 450 ms 4172 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 7833 ms 4284 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 7570 ms 4272 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 7620 ms 4364 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 7629 ms 4276 KB Output isn't correct - number of calls to Secret by Init = 0, maximum number of calls to Secret by Query = 999