# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
77264 | MohamedAhmed0 | Secret (JOI14_secret) | C++14 | 1182 ms | 8632 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] , arr1[1001][1001];
#define MAX_VALUE 1000000000
void Init(int N, int A[])
{
for(int i = 0 ; i < N ; ++i)
arr[i] = A[i] ;
for(int i = 0 ; i < N ; ++i)
{
arr1[i][i] = arr[i] ;
for(int j = i+1 ; j <= N ; ++j)
arr1[i][j] = Secret(arr1[i][j-1] , arr[j]);
}
}
int Query(int l, int r)
{
return arr1[l][r] ;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |