//#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 'int Secret(int, int)':
secret.cpp:15:1: warning: no return statement in function returning non-void [-Wreturn-type]
15 | }
| ^
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;
| ~~^~~
/usr/bin/ld: /tmp/cc9BkGf1.o: in function `Secret(int, int)':
secret.cpp:(.text.unlikely+0x0): multiple definition of `Secret(int, int)'; /tmp/cc8x4hS2.o:grader.cpp:(.text+0x2d0): first defined here
collect2: error: ld returned 1 exit status
