| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 70241 |
2018-08-22T14:03:39 Z |
MladenP |
Secret (JOI14_secret) |
C++17 |
|
696 ms |
8668 KB |
#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 |
| 1 |
Correct |
188 ms |
4436 KB |
Output is correct - number of calls to Secret by Init = 3331, maximum number of calls to Secret by Query = 1 |
| 2 |
Correct |
187 ms |
4700 KB |
Output is correct - number of calls to Secret by Init = 3340, maximum number of calls to Secret by Query = 1 |
| 3 |
Correct |
186 ms |
4700 KB |
Output is correct - number of calls to Secret by Init = 3349, maximum number of calls to Secret by Query = 1 |
| 4 |
Correct |
665 ms |
8452 KB |
Output is correct - number of calls to Secret by Init = 7491, maximum number of calls to Secret by Query = 1 |
| 5 |
Correct |
618 ms |
8540 KB |
Output is correct - number of calls to Secret by Init = 7499, maximum number of calls to Secret by Query = 1 |
| 6 |
Correct |
683 ms |
8540 KB |
Output is correct - number of calls to Secret by Init = 7499, maximum number of calls to Secret by Query = 1 |
| 7 |
Correct |
696 ms |
8668 KB |
Output is correct - number of calls to Secret by Init = 7499, maximum number of calls to Secret by Query = 1 |
| 8 |
Correct |
628 ms |
8668 KB |
Output is correct - number of calls to Secret by Init = 7499, maximum number of calls to Secret by Query = 1 |
| 9 |
Correct |
661 ms |
8668 KB |
Output is correct - number of calls to Secret by Init = 7499, maximum number of calls to Secret by Query = 1 |
| 10 |
Correct |
664 ms |
8668 KB |
Output is correct - number of calls to Secret by Init = 7499, maximum number of calls to Secret by Query = 1 |
