# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
70241 | MladenP | Secret (JOI14_secret) | C++17 | 696 ms | 8668 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"
#define mid (l+r)/2
int n,i,a[1010],d[1010][1010];void Z(int l,int r){if(l>=r)return;for(int i=mid+1;i<=r;i++)d[mid][i]=Secret(d[mid][i-1],a[i]);for(int i=mid-2;i>=l;i--)d[i][mid-1]=Secret(a[i],d[i+1][mid-1]);Z(l,mid-1);Z(mid+1, r);}void Init(int N,int A[]){for(i=1,n=N;i<=n;i++)a[i]=A[i-1],d[i][i]=a[i];Z(1,N);}int Q(int l,int r,int L,int R){if(L<mid&&mid<=R)return Secret(d[L][mid-1],d[mid][R]);if(L==mid)return d[mid][R];if(mid<L)return Q(mid+1,r,L,R);return Q(l,mid-1,L,R);}int Query(int L,int R){L++;R++;if(L==R)return a[L];return Q(1,n,L,R);}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |