oj.uz

Submission #77259

# Submission time Handle Problem Language Result Execution time Memory
77259 2018-09-24T13:03:17 Z MohamedAhmed0 Secret (JOI14_secret) C++14
6 / 100
 11160 ms 4756 KB 
#include <bits/stdc++.h>
using namespace std ;
#include "secret.h"
int arr[100001] ;

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 2151 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 Incorrect 2118 ms 2532 KB Output isn't correct - number of calls to Secret by Init = 0, maximum number of calls to Secret by Query = 508
3 Incorrect 2133 ms 2536 KB Output isn't correct - number of calls to Secret by Init = 0, maximum number of calls to Secret by Query = 505
4 Incorrect 4434 ms 4512 KB Output isn't correct - number of calls to Secret by Init = 0, maximum number of calls to Secret by Query = 997
5 Incorrect 4488 ms 4512 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 646 ms 4512 KB Output is partially correct - number of calls to Secret by Init = 0, maximum number of calls to Secret by Query = 10
7 Incorrect 11160 ms 4604 KB Output isn't correct - number of calls to Secret by Init = 0, maximum number of calls to Secret by Query = 999
8 Incorrect 10732 ms 4604 KB Output isn't correct - number of calls to Secret by Init = 0, maximum number of calls to Secret by Query = 999
9 Incorrect 10627 ms 4756 KB Output isn't correct - number of calls to Secret by Init = 0, maximum number of calls to Secret by Query = 998
10 Incorrect 10707 ms 4756 KB Output isn't correct - number of calls to Secret by Init = 0, maximum number of calls to Secret by Query = 999