# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1018216 | TsotneSV | Secret (JOI14_secret) | C++14 | 336 ms | 4440 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 MAXN = 1005;
const int LVL=15;
int DAQ[LVL][MAXN],n;
void go(int l,int r,int lev,int A[]) {
if(l == r) {
DAQ[lev][l] = A[l];
return;
}
int m = (l + r)>>1;
DAQ[lev][m] = A[m]; DAQ[lev][m+1] = A[m+1];
for(int i=m-1;i>=l;i--) {
DAQ[lev][i] = Secret(A[i],DAQ[lev][i+1]);
}
for(int i=m+2;i<=r;i++) {
DAQ[lev][i] = Secret(A[i],DAQ[lev][i-1]);
}
go(l,m,lev+1,A);
go(m+1,r,lev+1,A);
}
int f(int L,int R,int l,int r,int lev) {
if(l == r) return DAQ[lev][L];
int m = (l + r)>>1;
if(m >= R) return f(L,R,l,m,lev+1);
if(m+1 <= L) return f(L,R,m+1,r,lev+1);
return Secret(DAQ[lev][L],DAQ[lev][R]);
}
void Init(int N, int A[]) {
n = N;
go(0,n-1,0,A);
}
int Query(int L, int R) {
return f(L,R,0,n-1,0);
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |