#include "secret.h"
#include <bits/stdc++.h>
using namespace std;
const int mxN = 1010;
int n, a[mxN], ans[mxN][mxN];
void dnc(int l, int r){
if(l==r) return;
int m = (l+r)/2;
for(int i = m-1; i>=l; i--) ans[m][i] = Secret(a[i],ans[m][i+1]);
for(int i = m+2; i<=r; i++) ans[m+1][i] = Secret(a[i],ans[m+1][i-1]);
dnc(l,m), dnc(m+1,r);
}
int dnc2(int l, int r, int L, int R){
if(l==r) return a[l];
int m = (l+r)/2;
if(L<=m and m<R)
return Secret(ans[m][L],ans[m+1][R]);
if(m==R) return ans[m][L];
if(m<L) return dnc2(l,m,L,R);
return dnc2(m+1,r,L,R);
}
void Init(int N, int A[]) {
for(int i = 0; i < N; i++) a[i]=A[i];
dnc(0,N-1); n=N;
}
int Query(int L, int R) {
if(L==R) return a[L];
return dnc2(0,n-1,L,R);
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
114 ms |
4372 KB |
Wrong Answer: Query(222, 254) - expected : 34031541, actual : 847844452. |
2 |
Incorrect |
125 ms |
4352 KB |
Wrong Answer: Query(60, 375) - expected : 669221184, actual : 885587977. |
3 |
Incorrect |
118 ms |
4284 KB |
Wrong Answer: Query(211, 401) - expected : 674373968, actual : 808929308. |
4 |
Incorrect |
417 ms |
8140 KB |
Wrong Answer: Query(90, 497) - expected : 397934825, actual : 615503535. |
5 |
Incorrect |
431 ms |
8208 KB |
Wrong Answer: Query(587, 915) - expected : 752404486, actual : 423036959. |
6 |
Incorrect |
424 ms |
8124 KB |
Wrong Answer: Query(738, 741) - expected : 983692994, actual : 422971424. |
7 |
Incorrect |
433 ms |
8308 KB |
Wrong Answer: Query(84, 976) - expected : 742463504, actual : 633929753. |
8 |
Incorrect |
428 ms |
8152 KB |
Wrong Answer: Query(58, 987) - expected : 20022464, actual : 469988544. |
9 |
Incorrect |
429 ms |
8248 KB |
Wrong Answer: Query(33, 967) - expected : 676869696, actual : 281020802. |
10 |
Incorrect |
429 ms |
8232 KB |
Wrong Answer: Query(116, 961) - expected : 68487362, actual : 541345164. |