//#pragma GCC optimize("Ofast")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,fma")
//#pragma GCC optimize("unroll-loops")
#include<bits/stdc++.h>
#include "secret.h"
#define ll long long
const int nmax = 1000 + 5;
using namespace std;
int n, a[nmax];
int L[20][nmax], R[20][nmax];
//int Secret(int a, int b){
//}
void build(int id, int l, int r){
if(l == r) return;
int mid = r + l >> 1;
L[id][mid] = a[mid];
R[id][mid + 1] = a[mid + 1];
for(int i = mid - 1; i >= l; --i) L[id][i] = Secret(L[id][i + 1], a[i]);
for(int i = mid + 2; i <= r; ++i) R[id][i] = Secret(R[id][i - 1], a[i]);
build(id + 1, l, mid);
build(id + 1, mid + 1, r);
}
int get(int id, int l, int r, int u, int v){
int mid = r + l >> 1;
if(u <= mid && mid + 1 <= v) return Secret(L[id][u], R[id][v]);
if(u == mid + 1) return R[id][v];
if(v== mid) return L[id][u];
if(mid < u) return get(id + 1, mid + 1, r, u, v);
if(mid + 1 > v) return get(id + 1, l, mid, u, v);
return get(id + 1, l, mid, u, v)+ get(id + 1, mid + 1, r, u, v);
}
void Init(int N, int A[]){
n = N;
for(int i = 0; i < n; ++i) a[i] = A[i];
build(1, 0, n - 1);
}
int Query(int l, int r){
if(l == r) return a[l];
return get(1, 0, n - 1, l, r);
}
Compilation message
secret.cpp: In function 'void build(int, int, int)':
secret.cpp:18:17: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
18 | int mid = r + l >> 1;
| ~~^~~
secret.cpp: In function 'int get(int, int, int, int, int)':
secret.cpp:27:17: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
27 | int mid = r + l >> 1;
| ~~^~~
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
68 ms |
2652 KB |
Wrong Answer: Query(222, 254) - expected : 34031541, actual : 268854015. |
2 |
Incorrect |
93 ms |
2748 KB |
Wrong Answer: Query(60, 375) - expected : 669221184, actual : 311474560. |
3 |
Incorrect |
68 ms |
2748 KB |
Wrong Answer: Query(211, 401) - expected : 674373968, actual : 353554500. |
4 |
Incorrect |
267 ms |
4288 KB |
Wrong Answer: Query(90, 497) - expected : 397934825, actual : 343081568. |
5 |
Incorrect |
255 ms |
4436 KB |
Wrong Answer: Query(587, 915) - expected : 752404486, actual : 957013316. |
6 |
Incorrect |
274 ms |
4268 KB |
Wrong Answer: Query(200, 208) - expected : 277813445, actual : 154975445. |
7 |
Incorrect |
260 ms |
4484 KB |
Wrong Answer: Query(84, 976) - expected : 742463504, actual : 675449873. |
8 |
Incorrect |
259 ms |
4268 KB |
Wrong Answer: Query(58, 987) - expected : 20022464, actual : 273091792. |
9 |
Incorrect |
256 ms |
4436 KB |
Wrong Answer: Query(33, 967) - expected : 676869696, actual : 827853577. |
10 |
Incorrect |
274 ms |
4272 KB |
Wrong Answer: Query(116, 961) - expected : 68487362, actual : 337854787. |