oj.uz

Submission #77258

# Submission time Handle Problem Language Result Execution time Memory
77258 2018-09-24T12:58:42 Z MohamedAhmed0 Secret (JOI14_secret) C++14
6 / 100
 11059 ms 4684 KB 
#include <bits/stdc++.h>
using namespace std ;
#include "secret.h"
int arr[1001] ;

void Init(int N, int A[])
{
    for(int i = 0 ; i < N ; ++i)
        arr[i] = A[i] ;
}
int Query(int l, int r)
{
    int x = arr[l] ;
    for(int i = l+1 ; i <= r ; ++i)
        x = Secret(x , arr[i]);
    return x ;
}

Subtask #1
6.0 / 100.0

# Verdict Execution time Memory Grader output
1 Incorrect 2138 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 Incorrect 2086 ms 2556 KB Output isn't correct - number of calls to Secret by Init = 0, maximum number of calls to Secret by Query = 508
3 Incorrect 2153 ms 2604 KB Output isn't correct - number of calls to Secret by Init = 0, maximum number of calls to Secret by Query = 505
4 Incorrect 4427 ms 4552 KB Output isn't correct - number of calls to Secret by Init = 0, maximum number of calls to Secret by Query = 997
5 Incorrect 4433 ms 4552 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 653 ms 4552 KB Output is partially correct - number of calls to Secret by Init = 0, maximum number of calls to Secret by Query = 10
7 Incorrect 11059 ms 4552 KB Output isn't correct - number of calls to Secret by Init = 0, maximum number of calls to Secret by Query = 999
8 Incorrect 10646 ms 4552 KB Output isn't correct - number of calls to Secret by Init = 0, maximum number of calls to Secret by Query = 999
9 Incorrect 10835 ms 4612 KB Output isn't correct - number of calls to Secret by Init = 0, maximum number of calls to Secret by Query = 998
10 Incorrect 10973 ms 4684 KB Output isn't correct - number of calls to Secret by Init = 0, maximum number of calls to Secret by Query = 999