# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
53164 | okaybody10 | Secret (JOI14_secret) | C++11 | 715 ms | 8492 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 MX=1001;
int n, B[MX];
int D[MX][MX];
void _fill(int s, int e){
int m=(s+e)/2;
if(s==e){
D[m][m]=B[m];
return;
}
D[m][m]=B[m];
for(int x=m-1; x>=s; x--){
D[x][m]=Secret(B[x], D[x+1][m]);
}
D[m+1][m+1]=B[m+1];
for(int y=m+2; y<=e; y++)
D[m+1][y]=Secret(D[m+1][y-1], B[y]);
_fill(s,m);
_fill(m+1,e);
}
void Init(int N, int A[]) {
n=N;
for(int i=0; i<n; i++) B[i]=A[i];
_fill(0,n-1);
}
int solve(int l, int r, int s, int e){
int m=(s+e)/2;
if(l<=m && m+1<=r){
return Secret(D[l][m], D[m+1][r]);
}
if(r<=m) return solve(l,r,s,m);
else return solve(l,r,m+1,e);
}
int Query(int l, int r) {
if(l==r) return B[l];
return solve(l,r,0,n-1);
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |