Submission #1299429

#TimeUsernameProblemLanguageResultExecution timeMemory
1299429Faisal_SaqibSecret (JOI14_secret)C++20
100 / 100
348 ms8300 KiB
#include "secret.h" #include <iostream> using namespace std; const int N=1001; int val[N][N],n; void recur(int l,int r) { if(l==r)return; int mid=(l+r)/2; recur(l,mid); recur(mid+1,r); // computing all prefix for(int i=mid+1;i<=r;i++) { if(val[mid+1][i]==-1) { val[mid+1][i]=Secret(val[mid+1][i-1],val[i][i]); } } // computing all suffix for(int i=mid;i>=l;i--) { if(val[i][mid]==-1) { val[i][mid]=Secret(val[i][i],val[i+1][mid]); } } } int get(int l,int r,int ql=0,int qr=n-1) { if(l<=ql and qr<=r) { // fully inside return val[ql][qr]; } int m=(ql+qr)/2; if(r<=m) { return get(l,r,ql,m); } else if(l>=m+1) { return get(l,r,m+1,qr); } else { return Secret(val[l][m],val[m+1][r]); } } void Init(int N, int A[]) { n=N; for(int i=0;i<n;i++) { for(int j=0;j<n;j++) { val[i][j]=-1; } val[i][i]=A[i]; } recur(0,n-1); } int Query(int L, int R) { for(int i=L;i<R;i++) { if(val[L][i]!=-1 and val[i+1][R]!=-1) { return Secret(val[L][i], val[i+1][R]); } } return val[L][R]; }
#Verdict Execution timeMemoryGrader output
Fetching results...