#include "secret.h"
#define m (l+r)/2
#define G return
#define s Secret
int n,i,a[1010],d[1010][1010];void Z(int l,int r){if(l>=r)G;for(int i=m+1;i<=r;i++)d[m][i]=s(d[m][i-1],a[i]);for(int i=m-2;i>=l;i--)d[i][m-1]=Secret(a[i],d[i+1][m-1]);Z(l,m-1);Z(m+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<m&&m<=R)G Secret(d[L][m-1],d[m][R]);if(L==m)G d[m][R];if(m<L)G Q(m+1,r,L,R);G Q(l,m-1,L,R);}int Query(int L,int R){L++;R++;if(L==R)G a[L];G Q(1,n,L,R);}
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
191 ms |
4600 KB |
Output is correct - number of calls to Secret by Init = 3331, maximum number of calls to Secret by Query = 1 |
| 2 |
Correct |
196 ms |
4600 KB |
Output is correct - number of calls to Secret by Init = 3340, maximum number of calls to Secret by Query = 1 |
| 3 |
Correct |
191 ms |
4600 KB |
Output is correct - number of calls to Secret by Init = 3349, maximum number of calls to Secret by Query = 1 |
| 4 |
Correct |
619 ms |
8564 KB |
Output is correct - number of calls to Secret by Init = 7491, maximum number of calls to Secret by Query = 1 |
| 5 |
Correct |
619 ms |
8564 KB |
Output is correct - number of calls to Secret by Init = 7499, maximum number of calls to Secret by Query = 1 |
| 6 |
Correct |
601 ms |
8616 KB |
Output is correct - number of calls to Secret by Init = 7499, maximum number of calls to Secret by Query = 1 |
| 7 |
Correct |
638 ms |
8616 KB |
Output is correct - number of calls to Secret by Init = 7499, maximum number of calls to Secret by Query = 1 |
| 8 |
Correct |
652 ms |
8624 KB |
Output is correct - number of calls to Secret by Init = 7499, maximum number of calls to Secret by Query = 1 |
| 9 |
Correct |
655 ms |
8624 KB |
Output is correct - number of calls to Secret by Init = 7499, maximum number of calls to Secret by Query = 1 |
| 10 |
Correct |
662 ms |
8624 KB |
Output is correct - number of calls to Secret by Init = 7499, maximum number of calls to Secret by Query = 1 |
