#include "secret.h"
int prefix[1006][1006];
int n;
void precompute(int l,int r,int A[])
{
int mid = (l+r)/2;
prefix[mid][mid]=A[mid];
prefix[mid+1][mid+1]=A[mid+1];
for(int i=mid+2;i<=r;i++)
prefix[mid+1][i] = Secret(prefix[mid+1][i-1],A[i]);
for(int i=mid-1;i>=l;i--)
prefix[mid][i] = Secret(A[i],prefix[mid][i+1]);
if(mid+1<r)
precompute(mid+1,r,A);
if(mid>l)
precompute(l,mid,A);
}
void Init(int N, int A[])
{
n=N;
precompute(0,N-1,A);
}
int Query(int L, int R)
{
int l = 0, r = n-1;
while(l!=r)
{
int mid = (l+r)/2;
if(mid>=L && mid+1<=R)
return Secret(prefix[mid][L],prefix[mid+1][R]);
else if(mid==R)
return prefix[mid][L];
else if(mid<L)
l=mid+1;
else r=mid;
}
return prefix[l][l];
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
122 ms |
4356 KB |
Output is correct - number of calls to Secret by Init = 3578, maximum number of calls to Secret by Query = 1 |
2 |
Correct |
121 ms |
4292 KB |
Output is correct - number of calls to Secret by Init = 3586, maximum number of calls to Secret by Query = 1 |
3 |
Correct |
120 ms |
4360 KB |
Output is correct - number of calls to Secret by Init = 3595, maximum number of calls to Secret by Query = 1 |
4 |
Correct |
425 ms |
8108 KB |
Output is correct - number of calls to Secret by Init = 7969, maximum number of calls to Secret by Query = 1 |
5 |
Correct |
427 ms |
8272 KB |
Output is correct - number of calls to Secret by Init = 7978, maximum number of calls to Secret by Query = 1 |
6 |
Correct |
432 ms |
8204 KB |
Output is correct - number of calls to Secret by Init = 7978, maximum number of calls to Secret by Query = 1 |
7 |
Correct |
424 ms |
8172 KB |
Output is correct - number of calls to Secret by Init = 7978, maximum number of calls to Secret by Query = 1 |
8 |
Correct |
424 ms |
8080 KB |
Output is correct - number of calls to Secret by Init = 7978, maximum number of calls to Secret by Query = 1 |
9 |
Correct |
421 ms |
8196 KB |
Output is correct - number of calls to Secret by Init = 7978, maximum number of calls to Secret by Query = 1 |
10 |
Correct |
425 ms |
8272 KB |
Output is correct - number of calls to Secret by Init = 7978, maximum number of calls to Secret by Query = 1 |