#include "secret.h"
#include <bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(),(x).end()
#define fi first
#define sc second
//#define endl "\n"
#define pii pair<int,int>
using namespace std;
const int MAXN = 1e3+5;
const int mod7 = 1e9+7;
const long long inf = 1e18;
int niz[MAXN];
int n;
map<pii, int> mapa;
vector<vector<int>> v(MAXN, vector<int>(MAXN));
int ask(int a, int b)
{
if(mapa.count(mp(a,b)))return mapa[mp(a,b)];
int p = Secret(a,b);
mapa[{a,b}] = p;
return p;
}
void build(int l, int r, int lvl)
{
if(l == r)return;
int mid = l+r >> 1;
v[mid][mid] = niz[mid];
v[mid+1][mid+1] = niz[mid+1];
for(int i=mid+2;i<=r; i++)v[mid+1][i] = ask(v[mid+1][i-1], niz[i]);
for(int i=mid-1;i>=l; i--)v[mid][i] = ask( niz[i],v[mid][i+1]);
//for(int i=mid;i>=l; i--)cout << v[lvl][i] << " ";cout << endl;
build(l, mid, lvl+1);
build(mid+1,r, lvl+1);
}
int query(int l, int r, int lvl, int L, int R)
{
}
void Init(int N, int A[]) {
n = N;
for(int i=1; i<=n; i++)niz[i] = A[i-1];
build(1,n, 0);
}
int Query(int L, int R) {
if(L == R)return niz[L+1];
int l = 1;int r = n;
while(l<r)
{
int mid = l+r>>1;
if(L <= mid && R> mid)return ask(v[mid][L], v[mid+1][R]);
else if(R == mid)return v[mid][L];
else if(L > mid)l = mid+1;
else r = mid;
}
return prefix[l][l];
}
Compilation message
secret.cpp: In function 'void build(int, int, int)':
secret.cpp:32:16: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
32 | int mid = l+r >> 1;
| ~^~
secret.cpp: In function 'int query(int, int, int, int, int)':
secret.cpp:46:1: warning: no return statement in function returning non-void [-Wreturn-type]
46 | }
| ^
secret.cpp: In function 'int Query(int, int)':
secret.cpp:59:20: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
59 | int mid = l+r>>1;
| ~^~
secret.cpp:65:12: error: 'prefix' was not declared in this scope
65 | return prefix[l][l];
| ^~~~~~
