# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1018225 | TsotneSV | Secret (JOI14_secret) | C++17 | 309 ms | 4436 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 = 1000;
const int maxlvl = 15;
int n;
int DVC[maxlvl][maxn];
void create(int lvl,int l,int r,int A[]) {
if(l == r) {
DVC[lvl][l] = A[l];
return;
}
int m = (l + r)>>1;
DVC[lvl][m] = A[m];
for(int i=m-1;i>=l;i--) DVC[lvl][i] = Secret(A[i],DVC[lvl][i+1]);
DVC[lvl][m+1] = A[m+1];
for(int i=m+2;i<=r;i++) DVC[lvl][i] = Secret(A[i],DVC[lvl][i-1]);
create(lvl+1,l,m,A);
create(lvl+1,m+1,r,A);
}
int get(int lvl,int l,int r,int L,int R) {
if(l == r) return DVC[lvl][L];
int m = (l + r)>>1;
if(R <= m) return get(lvl+1,l,m,L,R);
if(L >= m+1) return get(lvl+1,m+1,r,L,R);
return Secret(DVC[lvl][L],DVC[lvl][R]);
}
void Init(int N, int A[]) {
n = N;
create(0,0,n-1,A);
}
int Query(int L, int R) {
return get(0,0,n-1,L,R);
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |