#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(prefix[mid][i+1],A[i]);
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]);///answers even if only on the left side there is query
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 |
Incorrect |
110 ms |
4320 KB |
Wrong Answer: Query(222, 254) - expected : 34031541, actual : 268854015. |
2 |
Incorrect |
114 ms |
4348 KB |
Wrong Answer: Query(60, 375) - expected : 669221184, actual : 311474560. |
3 |
Incorrect |
111 ms |
4352 KB |
Wrong Answer: Query(211, 401) - expected : 674373968, actual : 353554500. |
4 |
Incorrect |
411 ms |
8108 KB |
Wrong Answer: Query(90, 497) - expected : 397934825, actual : 343081568. |
5 |
Incorrect |
417 ms |
8100 KB |
Wrong Answer: Query(587, 915) - expected : 752404486, actual : 957013316. |
6 |
Incorrect |
413 ms |
8176 KB |
Wrong Answer: Query(200, 208) - expected : 277813445, actual : 154975445. |
7 |
Incorrect |
419 ms |
8224 KB |
Wrong Answer: Query(84, 976) - expected : 742463504, actual : 675449873. |
8 |
Incorrect |
415 ms |
8108 KB |
Wrong Answer: Query(58, 987) - expected : 20022464, actual : 273091792. |
9 |
Incorrect |
413 ms |
8116 KB |
Wrong Answer: Query(33, 967) - expected : 676869696, actual : 827853577. |
10 |
Incorrect |
415 ms |
8108 KB |
Wrong Answer: Query(116, 961) - expected : 68487362, actual : 337854787. |