#include "prize.h"
#include<bits/stdc++.h>
using namespace std;
using ll = int;
int find_best(int n) {
mt19937_64 mt(random_device{}());
vector<array<ll,2>> mem(n,{-1,-1});
auto qry = [&](ll i){
if (mem[i][0]==-1){
auto a = ask(i);
mem[i] = {a[0],a[1]};
}
return mem[i];
};
ll cnt = 449;
vector<ll> a(n);
iota(a.begin(),a.end(),0);
shuffle(a.begin(),a.end(),mt);
ll mx = 0;
for(ll i = 0;i<cnt;i++){
mx = max(mx,qry[a[i]]);
}
ll ans = -1;
function<void(ll,ll,ll,ll)> dfs;
dfs = [&](ll l, ll r,ll dl, ll dr){
if (ans != -1) return;
if (l == r){
ans = l;
return;
}
array<ll,2> o = {-1,-1};
ll m = l+r>>1;
while(o[0]+o[1]!=0&&o[0]+o[1]!=mx){
m = l+mt()%(r-l+1);
o = qry(m);
}
if (o[0]+o[1]==0) {
ans = m;
return;
}
if (o[0]-dl>0){
dfs(l,m-1,dl,o[1]);
}
if(o[1]-dr>0){
dfs(m+1,r,o[0],dr);
}
};
dfs(0,n-1,0,0);
return ans;
}
Compilation message
prize.cpp: In function 'int find_best(int)':
prize.cpp:21:18: error: no match for 'operator[]' (operand types are 'find_best(int)::<lambda(ll)>' and '__gnu_cxx::__alloc_traits<std::allocator<int>, int>::value_type' {aka 'int'})
21 | mx = max(mx,qry[a[i]]);
| ^
prize.cpp: In lambda function:
prize.cpp:32:11: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
32 | ll m = l+r>>1;
| ~^~
