#include "secret.h"
#include <bits/stdc++.h>
using namespace std;
const int mxN = 1010;
int n, 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[i][m] = Secret(ans[i+1][m],ans[i][i]);
for(int i = m+1; i<=r; i++) ans[i][m] = Secret(ans[i][i],ans[i-1][i]);
dnc(l,m), dnc(m+1,r);
}
int dnc2(int l, int r, int L, int R){
if(l==r) return ans[l][r];
int m = (l+r)/2;
if(L<=m and m<=R)
return Secret(ans[l][m],ans[m+1][r]);
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++)
ans[i][i]=A[i];
dnc(1,N); n=N;
}
int Query(int L, int R) {
if(L==R) return ans[L][L];
return dnc2(1,n,L,R);
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
117 ms |
4472 KB |
Wrong Answer: Query(222, 254) - expected : 34031541, actual : 0. |
2 |
Incorrect |
120 ms |
4416 KB |
Wrong Answer: Query(60, 375) - expected : 669221184, actual : 605100136. |
3 |
Incorrect |
115 ms |
4488 KB |
Wrong Answer: Query(211, 401) - expected : 674373968, actual : 748724342. |
4 |
Incorrect |
425 ms |
8340 KB |
Wrong Answer: Query(90, 497) - expected : 397934825, actual : 0. |
5 |
Incorrect |
444 ms |
8556 KB |
Wrong Answer: Query(587, 915) - expected : 752404486, actual : 125942547. |
6 |
Incorrect |
424 ms |
8440 KB |
Wrong Answer: Query(738, 741) - expected : 983692994, actual : 126008082. |
7 |
Incorrect |
445 ms |
8220 KB |
Wrong Answer: Query(84, 976) - expected : 742463504, actual : 234524674. |
8 |
Incorrect |
423 ms |
8312 KB |
Wrong Answer: Query(58, 987) - expected : 20022464, actual : 497243464. |
9 |
Incorrect |
423 ms |
8408 KB |
Wrong Answer: Query(33, 967) - expected : 676869696, actual : 953427266. |
10 |
Incorrect |
449 ms |
8308 KB |
Wrong Answer: Query(116, 961) - expected : 68487362, actual : 342746249. |