# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
77261 | 2018-09-24T13:07:17 Z | MohamedAhmed0 | Secret (JOI14_secret) | C++14 | 0 ms | 0 KB |
#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 ; }