# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
95288 | dalgerok | Secret (JOI14_secret) | C++14 | 507 ms | 9504 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 "secret.h"
#include<bits/stdc++.h>
using namespace std;
const int N = 1005;
int n, a[N], dp[N][N];
bool used[N][N];
void rec(int l, int r){
if(l == r){
return;
}
if(l + 1 == r){
return;
}
int mid = (r + l) >> 1;
dp[mid][mid] = a[mid];
dp[mid + 1][mid + 1] = a[mid + 1];
for(int i = mid + 2; i <= r; i++){
if(!used[mid + 1][i]){
used[mid + 1][i] = true;
dp[mid + 1][i] = Secret(dp[mid + 1][i - 1], a[i]);
}
}
for(int i = mid - 1; i >= l; i--){
if(!used[i][mid]){
used[i][mid] = true;
dp[i][mid] = Secret(a[i], dp[i + 1][mid]);
}
}
rec(l, mid);
rec(mid + 1, r);
}
void Init(int N, int A[]){
n = N;
for(int i = 0; i < n; i++){
a[i] = A[i];
}
rec(0, n - 1);
}
int Query(int L, int R){
if(L == R){
return a[L];
}
if(L + 1 == R){
return Secret(a[L], a[R]);
}
int l = 0, r = n - 1;
while(r - l > 1){
int mid = (r + l) >> 1;
if(L <= mid && mid + 1 <= R){
return Secret(dp[L][mid], dp[mid + 1][R]);
}
if(R <= mid){
r = mid;
}
else{
l = mid + 1;
}
}
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |