#include "secret.h"
#include<bits/stdc++.h>
using namespace std ;
const int mx = 1024 ;
int pre[mx][mx] , a[mx] , n ;
void dnc(int l , int r , int d)
{
if(l+1==r) return ;
if(l==r) return ;
int mid = (l+r)/2 ;
pre[d][mid] = a[mid] ;
for(int i = mid - 1 ; i >= l ; --i)
{
pre[d][i] = Secret(pre[d][i+1],a[i]) ;
}
pre[d][mid+1] = a[mid+1] ;
for(int i = mid + 2 ; i <= r ; ++i)
{
pre[d][i] = Secret(pre[d][i-1],a[i]) ;
}
dnc(l,mid,d+1) , dnc(mid+1,r,d+1) ;
}
void Init(int N , int A[])
{
n = N ;
for(int i = 0 ; i < N ; ++i) a[i] = A[i] ;
dnc(0,N-1,0) ;
}
int dq_c(int l , int r , int ql , int qr , int d)
{
int mid = (l+r)/2 ;
if((ql<=mid) && (qr>mid))
{
return Secret(pre[d][ql],pre[d][qr]) ;
}
if(qr==mid) return pre[d][ql] ;
if(qr<=mid) return dq_c(l,mid,ql,qr,d+1) ;
else return dq_c(mid+1,r,ql,qr,d+1) ;
}
int Query(int L , int R)
{
if(L==R) return a[L] ;
if(L+1==R) return Secret(a[L],a[R]) ;
return dq_c(0,n-1,0,L,R) ;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
152 ms |
2472 KB |
Wrong Answer: Query(222, 254) - expected : 34031541, actual : 536870912. |
2 |
Incorrect |
131 ms |
2412 KB |
Wrong Answer: Query(60, 375) - expected : 669221184, actual : 0. |
3 |
Incorrect |
157 ms |
2412 KB |
Wrong Answer: Query(211, 401) - expected : 674373968, actual : 536870912. |
4 |
Incorrect |
513 ms |
4404 KB |
Wrong Answer: Query(90, 497) - expected : 397934825, actual : 536870912. |
5 |
Incorrect |
524 ms |
4360 KB |
Wrong Answer: Query(587, 915) - expected : 752404486, actual : 536870912. |
6 |
Incorrect |
512 ms |
4376 KB |
Wrong Answer: Query(738, 741) - expected : 983692994, actual : 536870912. |
7 |
Incorrect |
522 ms |
4492 KB |
Wrong Answer: Query(84, 976) - expected : 742463504, actual : 0. |
8 |
Incorrect |
527 ms |
4352 KB |
Wrong Answer: Query(58, 987) - expected : 20022464, actual : 536870912. |
9 |
Incorrect |
515 ms |
4356 KB |
Wrong Answer: Query(33, 967) - expected : 676869696, actual : 0. |
10 |
Incorrect |
498 ms |
4460 KB |
Wrong Answer: Query(116, 961) - expected : 68487362, actual : 0. |