# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
166527 | losmi247 | Secret (JOI14_secret) | C++14 | 620 ms | 8440 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>
#include "secret.h"
using namespace std;
typedef long long ll;
typedef pair <int,int> p;
const int N = 1005;
int n,a[N];
int x[N][N];
void nesto(int l,int r){
int mid = l+(r-l)/2;
if(mid >= r || mid < l){
return;
}
x[mid][mid] = a[mid];
x[mid+1][mid+1] = a[mid+1];
for(int i = mid-1; i >= l; i--){
x[i][mid] = Secret(a[i],x[i+1][mid]);
}
for(int i = mid+2; i <= r; i++){
x[mid+1][i] = Secret(x[mid+1][i-1],a[i]);
}
nesto(l,mid);
nesto(mid+1,r);
}
int Query(int l,int r){
if(l == r){
return a[l];
}
if(l+1 == r){
return Secret(a[l],a[r]);
}
for(int i = l; i < r; i++){
if(x[l][i] != -1 && x[i+1][r] != -1){
return Secret(x[l][i],x[i+1][r]);
}
}
}
void Init(int l,int d[]){
n = l;
for(int i = 1; i <= n; i++){
a[i] = d[i-1];
}
for(int i = 1; i <= n; i++){
for(int j = 1; j <= n; j++){
x[i][j] = -1;
}
}
nesto(1,n);
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |