| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 77261 | MohamedAhmed0 | Secret (JOI14_secret) | C++14 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#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 ;
}