Submission #979094

#TimeUsernameProblemLanguageResultExecution timeMemory
979094lftroqSecret (JOI14_secret)C++14
0 / 100
374 ms8328 KiB
#include<secret.h> int pref[1005][1005],n,mask[1005]; void dnc(int l,int r,int level,int a[]) { int mid=(l+r)>>1; pref[mid][mid]=a[mid]; pref[mid+1][mid+1]=a[mid+1]; for(int i=mid+2;i<=r;i++) pref[mid+1][i]=Secret(pref[mid+1][i-1],a[i]); for(int i=mid-1;i>=l;i--) pref[mid][i]=Secret(pref[mid][i+1],a[i]); for(int i=mid+1;i<=r;i++) mask[i]|=(1<<level); if(l<mid) dnc(l,mid,level+1,a); if(mid+1<r) dnc(mid+1,r,level+1,a); } void Init(int N,int A[]) { dnc(0,N-1,0,A); } int Query(int L,int R) { int k=__builtin_ctz(mask[L]^mask[R]); return Secret(pref[k][L],pref[k][R]); }
#Verdict Execution timeMemoryGrader output
Fetching results...