#include "secret.h"
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 1000;
const int LVL=15;
int DVC[LVL][MAXN],n;
void create(int l,int r,int lvl,int A[]) {
if(l == r) {
DVC[lvl][l] = A[l];
return;
}
int m = (l + r)>>1;
DVC[lvl][m] = A[m];
for(int i=m-1;i>=l;i--) DVC[lvl][i] = Secret(A[i],DVC[lvl][i+1]);
DVC[lvl][m+1] = A[m+1];
for(int i=m+2;i<=r;i++) DVC[lvl][i] = Secret(A[i],DVC[lvl][i-1]);
create(l,m,lvl+1,A);
create(m+1,r,lvl+1,A);
}
int get(int L,int R,int l,int r,int lvl) {
if(l == r) return DVC[lvl][L];
int m = (l + r)>>1;
if(m >= R) return get(L,R,l,m,lvl+1);
if(m+1 <= L) return get(L,R,m+1,r,lvl+1);
return Secret(DVC[lvl][L],DVC[lvl][R]);
}
void Init(int N, int A[]) {
n = N;
create(0,n-1,0,A);
}
int Query(int L, int R) {
return get(L,R,0,n-1,0);
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
78 ms |
2384 KB |
Wrong Answer: Query(222, 254) - expected : 34031541, actual : 809782271. |
2 |
Incorrect |
78 ms |
2384 KB |
Wrong Answer: Query(60, 375) - expected : 669221184, actual : 68749376. |
3 |
Incorrect |
80 ms |
2568 KB |
Wrong Answer: Query(211, 401) - expected : 674373968, actual : 136349820. |
4 |
Incorrect |
308 ms |
4392 KB |
Wrong Answer: Query(90, 497) - expected : 397934825, actual : 650789536. |
5 |
Incorrect |
299 ms |
4436 KB |
Wrong Answer: Query(587, 915) - expected : 752404486, actual : 377506838. |
6 |
Incorrect |
302 ms |
4404 KB |
Wrong Answer: Query(738, 741) - expected : 983692994, actual : 61461050. |
7 |
Incorrect |
304 ms |
4436 KB |
Wrong Answer: Query(84, 976) - expected : 742463504, actual : 687550570. |
8 |
Incorrect |
310 ms |
4480 KB |
Wrong Answer: Query(58, 987) - expected : 20022464, actual : 145923264. |
9 |
Incorrect |
305 ms |
4304 KB |
Wrong Answer: Query(33, 967) - expected : 676869696, actual : 18757135. |
10 |
Incorrect |
306 ms |
4436 KB |
Wrong Answer: Query(116, 961) - expected : 68487362, actual : 70590726. |