Submission #740338

#TimeUTC-0UsernameProblemLanguageResultExecution timeMemory
7403382023-05-12 10:57:59TheOpChickenSecret (JOI14_secret)C++17
100 / 100
440 ms8316 KiB
#include "secret.h"
#include <bits/stdc++.h>
const int N = 1e3;
int val[N][N];
int a[N];
void rec(int l, int r){
if(l > r)
return;
if(l == r){
val[l][l] = a[l];
return;
}
int mid = (l + r) >> 1;
// (l, mid), (l + 1, mid), ..., (mid, mid)
val[mid][mid] = a[mid];
for(int i = mid-1; i >= l; i--){
val[i][mid] = Secret(a[i], val[i+1][mid]);
}
val[mid+1][mid+1] = a[mid+1];
for(int i = mid + 2; i <= r; i++){
val[mid+1][i] = Secret(val[mid+1][i-1], a[i]);
}
rec(l, mid);
rec(mid + 1, r);
}
void Init(int n, int A[]) {
for(int i = 0; i < n; i++){
a[i] = A[i];
}
memset(val, -1, sizeof(val));
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
#Verdict Execution timeMemoryGrader output
Fetching results...