제출 #77262

#제출 시각아이디문제언어결과실행 시간메모리
77262MohamedAhmed0비밀 (JOI14_secret)C++14
0 / 100
618 ms4772 KiB
#include <bits/stdc++.h>
using namespace std ;
#include "secret.h"
int arr[100001] ;
#define MAX_VALUE        1000000000

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)
    {
        int X = x , Y = arr[i] ;
        x = (X + 2 * (Y / 2) < MAX_VALUE) ? (X + 2 * (Y / 2)) : MAX_VALUE ;
    }
    return x ;
}
#Verdict Execution timeMemoryGrader output
Fetching results...