# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
293277 | RedNextCentury | Secret (JOI14_secret) | C++14 | 517 ms | 9192 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;
vector<int> centers;
vector<int> start, finish;
int val[2002][2002];
int a[2002];
int num=0;
//int Secret(int l,int r){return 0;}
void DC(int L,int R) {
if (L>R) return;
else {
int mid = (L+R)/2;
centers.push_back(mid);
start.push_back(L);
finish.push_back(R);
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]);
DC(L, mid-1);
DC(mid+1,R);
}
}
void Init(int N, int A[]) {
for (int i=0;i<N;i++) a[i] = A[i];
DC(0, N-1);
}
int Query(int L, int R) {
for (int i=0;i<centers.size();i++) {
if (start[i]<=L && finish[i]>=R && centers[i]<=R && centers[i]>=L) {
if (L==centers[i]+1 || R==centers[i]) return val[L][R];
return Secret(val[L][centers[i]], val[centers[i]+1][R]);
}
}
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |