#include<secret.h>
int pref[1005][1005],n,mask[1005];
void dnc(int l,int r,int level,int a[])
{
int mid=(l+r)>>1;
pref[mid][mid]=a[mid];
pref[mid+1][mid+1]=a[mid+1];
for(int i=mid+2;i<=r;i++) pref[mid+1][i]=Secret(pref[mid+1][i-1],a[i]);
for(int i=mid-1;i>=l;i--) pref[mid][i]=Secret(pref[mid][i+1],a[i]);
for(int i=mid+1;i<=r;i++) mask[i]|=(1<<level);
if(l<mid) dnc(l,mid,level+1,a);
if(mid+1<r) dnc(mid+1,r,level+1,a);
}
void Init(int N,int A[])
{
dnc(0,N-1,0,A);
}
int Query(int L,int R)
{
int k=__builtin_ctz(mask[L]^mask[R]);
return Secret(pref[k][L],pref[k+1][R]);
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
98 ms |
7760 KB |
Wrong Answer: Query(222, 254) - expected : 34031541, actual : 536870912. |
2 |
Incorrect |
96 ms |
7764 KB |
Wrong Answer: Query(60, 375) - expected : 669221184, actual : 0. |
3 |
Incorrect |
95 ms |
7764 KB |
Wrong Answer: Query(211, 401) - expected : 674373968, actual : 536870912. |
4 |
Incorrect |
360 ms |
8272 KB |
Wrong Answer: Query(90, 497) - expected : 397934825, actual : 536870912. |
5 |
Incorrect |
351 ms |
8264 KB |
Wrong Answer: Query(587, 915) - expected : 752404486, actual : 536870912. |
6 |
Incorrect |
351 ms |
8452 KB |
Wrong Answer: Query(915, 915) - expected : 282904741, actual : 536870912. |
7 |
Incorrect |
367 ms |
8348 KB |
Wrong Answer: Query(84, 976) - expected : 742463504, actual : 0. |
8 |
Incorrect |
353 ms |
8532 KB |
Wrong Answer: Query(58, 987) - expected : 20022464, actual : 536870912. |
9 |
Incorrect |
350 ms |
8324 KB |
Wrong Answer: Query(33, 967) - expected : 676869696, actual : 0. |
10 |
Incorrect |
353 ms |
8508 KB |
Wrong Answer: Query(116, 961) - expected : 68487362, actual : 0. |