Submission #53184

#TimeUsernameProblemLanguageResultExecution timeMemory
53184okaybody10Secret (JOI14_secret)C++98
100 / 100
626 ms8524 KiB
#include <bits/stdc++.h> #include "secret.h" using namespace std; int n,B[1006],ans[1006][1006]; void _init(int s, int e){ int m=(s+e)/2; if(s==e){ ans[m][m]=B[m]; return; } ans[m][m]=B[m]; for(int x=m-1; x>=s; x--){ ans[x][m]=Secret(B[x], ans[x+1][m]); } ans[m+1][m+1]=B[m+1]; for(int y=m+2; y<=e; y++) ans[m+1][y]=Secret(ans[m+1][y-1], B[y]); _init(s,m); _init(m+1,e); } void Init(int N, int A[]) { n=N; for(int i=0; i<n; i++) B[i]=A[i]; _init(0,n-1); } int solve(int l, int r, int s, int e){ int m=(s+e)/2; if(l<=m && m+1<=r){ return Secret(ans[l][m], ans[m+1][r]); } if(r<=m) return solve(l,r,s,m); else return solve(l,r,m+1,e); } int Query(int l, int r) { if(l==r) return B[l]; return solve(l,r,0,n-1); }
#Verdict Execution timeMemoryGrader output
Fetching results...