#include <bits/stdc++.h>
#include "secret.h"
using namespace std;
const int MXN = 1005;
int st[15][MXN], mask[MXN], a[MXN], n;
void dnc(int l, int r, int lev){
if(l == r)
return;
int mid = (l+r)>>1;
st[lev][mid] = a[mid];
st[lev][mid+1] = a[mid+1];
for(int i = mid-1; i >= l; --i)
st[lev][i] = Secret(a[i], st[lev][i+1]);
for(int i = mid+2; i <= r; i++)
st[lev][i] = Secret(st[lev][i-1], a[i]);
for(int i = mid+1; i <= r; i++)
mask[i] ^= (1 << lev);
dnc(l, mid, lev+1), dnc(mid+1, r, lev+1);
}
void Init(int N, int A[]){
for(int i = 0; i < N; i++)
a[i] = A[i];
dnc(0, N-1, 0);
}
int Query(int L, int R){
int level = __builtin_ctz(mask[L]^mask[R]);
return Secret(st[level][L], st[level][R]);
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
131 ms |
2412 KB |
Wrong Answer: Query(56, 56) - expected : 677274107, actual : 536870912. |
2 |
Incorrect |
134 ms |
2412 KB |
Wrong Answer: Query(389, 389) - expected : 472506730, actual : 0. |
3 |
Incorrect |
135 ms |
2540 KB |
Wrong Answer: Query(18, 18) - expected : 238214183, actual : 536870912. |
4 |
Incorrect |
503 ms |
4460 KB |
Wrong Answer: Query(788, 788) - expected : 937598145, actual : 536870912. |
5 |
Incorrect |
496 ms |
4460 KB |
Wrong Answer: Query(957, 957) - expected : 115761809, actual : 536870912. |
6 |
Incorrect |
498 ms |
4460 KB |
Wrong Answer: Query(915, 915) - expected : 282904741, actual : 536870912. |
7 |
Correct |
509 ms |
4368 KB |
Output is correct - number of calls to Secret by Init = 7978, maximum number of calls to Secret by Query = 1 |
8 |
Correct |
509 ms |
4460 KB |
Output is correct - number of calls to Secret by Init = 7978, maximum number of calls to Secret by Query = 1 |
9 |
Correct |
505 ms |
4460 KB |
Output is correct - number of calls to Secret by Init = 7978, maximum number of calls to Secret by Query = 1 |
10 |
Correct |
519 ms |
4332 KB |
Output is correct - number of calls to Secret by Init = 7978, maximum number of calls to Secret by Query = 1 |