Submission #1018206

#TimeUsernameProblemLanguageResultExecution timeMemory
1018206TsotneSVSecret (JOI14_secret)C++17
0 / 100
317 ms4436 KiB
#include "secret.h" #include <bits/stdc++.h> using namespace std; const int MAXN = 1005; const int LVL=15; int DAQ[MAXN][LVL],n,arr[MAXN]; void go(int l,int r,int lev) { if(l == r) { DAQ[l][lev] = arr[l]; return; } int m = (l + r)>>1; DAQ[m][lev] = arr[m]; DAQ[m+1][lev] = arr[m+1]; for(int i=m-1;i>=l;i--) { DAQ[i][lev] = Secret(arr[i],DAQ[i+1][lev]); } for(int i=m+2;i<=r;i++) { DAQ[i][lev] = Secret(arr[i],DAQ[i-1][lev]); } go(l,m,lev+1); go(m+1,r,lev+1); } void Init(int N, int A[]) { n = N; for(int i=0;i<n;i++) arr[i] = A[i]; go(0,n-1,0); } int f(int l,int r,int tl,int tr,int lev) { if(tl == tr) return arr[l]; int m = (tl + tr)>>1; if(m >= r) return f(l,r,tl,m,lev+1); if(m+1 <= l) return f(l,r,m+1,tr,lev+1); return Secret(DAQ[l][lev],DAQ[r][lev]); } int Query(int L, int R) { return f(L,R,0,n-1,0); }
#Verdict Execution timeMemoryGrader output
Fetching results...