답안 #979096

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
979096 2024-05-10T08:39:14 Z lftroq 비밀 (JOI14_secret) C++14
0 / 100
362 ms 5648 KB
#include<secret.h>

int pref[1005][1005],n,mask[1005];

void dnc(int l,int r,int level,int a[])
{
    if(l==r) return;
    int mid=(l+r)>>1;
    pref[level][mid]=a[mid];
    pref[level][mid+1]=a[mid+1];
    for(int i=mid+2;i<=r;i++) pref[level][i]=Secret(pref[level][i-1],a[i]);
    for(int i=mid-1;i>=l;i--) pref[level][i]=Secret(pref[level][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][R]);
}
# 결과 실행 시간 메모리 Grader output
1 Incorrect 97 ms 5604 KB Wrong Answer: Query(222, 254) - expected : 34031541, actual : 268854015.
2 Incorrect 95 ms 5456 KB Wrong Answer: Query(60, 375) - expected : 669221184, actual : 311474560.
3 Incorrect 97 ms 5508 KB Wrong Answer: Query(211, 401) - expected : 674373968, actual : 353554500.
4 Incorrect 362 ms 5584 KB Wrong Answer: Query(90, 497) - expected : 397934825, actual : 343081568.
5 Incorrect 352 ms 5576 KB Wrong Answer: Query(587, 915) - expected : 752404486, actual : 957013316.
6 Incorrect 359 ms 5424 KB Wrong Answer: Query(915, 915) - expected : 282904741, actual : 536870912.
7 Incorrect 351 ms 5648 KB Wrong Answer: Query(84, 976) - expected : 742463504, actual : 675449873.
8 Incorrect 351 ms 5624 KB Wrong Answer: Query(58, 987) - expected : 20022464, actual : 273091792.
9 Incorrect 356 ms 5616 KB Wrong Answer: Query(33, 967) - expected : 676869696, actual : 827853577.
10 Incorrect 353 ms 5456 KB Wrong Answer: Query(116, 961) - expected : 68487362, actual : 337854787.