oj.uz

답안 #77272

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
77272 2018-09-24T14:50:58 Z MohamedAhmed0 비밀 (JOI14_secret) C++14
30 / 100
 711 ms 8616 KB 
#include <bits/stdc++.h>
using namespace std ;
#include "secret.h"
int arr[100001] , arr1[1001][1001];
#define MAX_VALUE        1000000000

void build(int left , int right)
{
    if(left == right)
    {
        arr1[left][left] = arr[left];
        return ;
    }
    int mid = (left + right) >> 1 ;
    build(left , mid) ;
    build(mid + 1, right);
    arr1[left][right] = Secret(arr1[left][mid] , arr1[mid+1][right]);
}

int solve(int left , int right , int l , int r)
{
    if(left > r || right < l)
        return -1 ;
    if(left >= l && right <= r)
       return arr1[left][right] ;
    int mid = (left + right) >> 1 ;
    int x = solve(left , mid , l , r);
    int y = solve(mid + 1 , right , l , r);
    if(x != -1 && y != -1)
      return Secret(x , y);
    else if(x == -1)
        return y ;
    else if(y == -1)
        return x ;
}

int n ;

void Init(int N, int A[])
{
    srand(time(NULL));
    n = N ;
    for(int i = 0 ; i < N ; ++i)
        arr[i] = A[i] ;
    build(0 , N-1);
    for(int i = 0 ; i < 1000 ; ++i)
    {
        int x = rand() % 1000 , y = rand() % 1000 ;
        arr1[x][y] = solve(0 , n-1 , x , y);
    }
}
int Query(int l, int r)
{
    if(arr1[l][r] != 0)
        return arr1[l][r];
    return arr1[l][r] = solve(0 , n-1 , l , r);
}

Compilation message

secret.cpp: In function 'int solve(int, int, int, int)':
secret.cpp:35:1: warning: control reaches end of non-void function [-Wreturn-type]
 }
 ^

Subtask #1
30.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Partially correct 236 ms 5752 KB Output is partially correct - number of calls to Secret by Init = 2147, maximum number of calls to Secret by Query = 13
2 Partially correct 228 ms 5880 KB Output is partially correct - number of calls to Secret by Init = 2162, maximum number of calls to Secret by Query = 14
3 Partially correct 236 ms 5880 KB Output is partially correct - number of calls to Secret by Init = 2228, maximum number of calls to Secret by Query = 15
4 Partially correct 674 ms 8428 KB Output is partially correct - number of calls to Secret by Init = 4493, maximum number of calls to Secret by Query = 15
5 Partially correct 682 ms 8440 KB Output is partially correct - number of calls to Secret by Init = 4557, maximum number of calls to Secret by Query = 15
6 Partially correct 618 ms 8440 KB Output is partially correct - number of calls to Secret by Init = 4279, maximum number of calls to Secret by Query = 4
7 Partially correct 711 ms 8596 KB Output is partially correct - number of calls to Secret by Init = 4615, maximum number of calls to Secret by Query = 16
8 Partially correct 708 ms 8616 KB Output is partially correct - number of calls to Secret by Init = 4367, maximum number of calls to Secret by Query = 16
9 Partially correct 692 ms 8616 KB Output is partially correct - number of calls to Secret by Init = 4367, maximum number of calls to Secret by Query = 16
10 Partially correct 704 ms 8616 KB Output is partially correct - number of calls to Secret by Init = 4294, maximum number of calls to Secret by Query = 16