#include "prize.h"
#include <cstdlib>
#include <map>
#include <iostream>
using namespace std;
map<int, map<int, pair<int, int>>> resmap;
void resmap_push(int i, int lc, int rc) {
resmap[lc + rc][i] = {lc, rc};
}
map<int, vector<int>> askmp;
vector<int> myask(int i) {
if (askmp.find(i) == askmp.end()) {
askmp[i] = ask(i);
resmap_push(i, askmp[i][0], askmp[i][1]);
}
return askmp[i];
}
int gogo(int fr, int to, int lc, int rc, int mxc) {
// cout << "go " << fr << ' ' << to << endl;
if (lc + rc == mxc) {
return -1;
}
for (auto &rsmp : resmap) {
auto &mp = rsmp.second;
auto lb = mp.lower_bound(fr);
auto ub = mp.upper_bound(to);
pair<int, int> lres, rres;
// cout << "check " << rsmp.first << endl;
if (lb == mp.begin()) {
// cout << "no lb" << endl;
lres = {0, rsmp.first};
} else {
lb--;
// cout << "lb " << lb->first << endl;
lres = lb->second;
}
if (ub == mp.end()) {
// cout << "no ub" << endl;
rres = {rsmp.first, 0};
} else {
// cout << "ub " << ub->first << endl;
rres = ub->second;
}
if (lres.first == rres.first) {
// cout << "skip" << endl;
return -1;
}
}
int mid = (fr + to) / 2;
int lto = mid, rfr = mid + 1;
vector<int> res;
int n = to - fr;
for (int i = 0; i < n; i++) {
if (i & 1) {
mid -= i;
} else {
mid += i;
}
lto = min(lto, mid);
rfr = max(rfr, mid + 1);
res = myask(mid);
int c = res[0] + res[1];
if (c == 0) {
return mid;
} else if (c == mxc) {
int lrc, rlc;
if (mid == lto) {
lrc = res[1];
rlc = res[0] + i;
} else {
lrc = res[1] + i;
rlc = res[0];
}
int rt;
if (rand() & 1) {
rt = gogo(fr, lto, lc, lrc, mxc);
if (rt == -1) {
rt = gogo(rfr, to, rlc, rc, mxc);
}
} else {
rt = gogo(rfr, to, rlc, rc, mxc);
if (rt == -1) {
rt = gogo(fr, lto, lc, lrc, mxc);
}
}
return rt;
}
}
return -1;
}
int find_best(int n) {
srand(9987555);
resmap.clear();
int mxc = 0;
int lc = 0;
for(int i = 0; i < n && i < 500; i++) {
std::vector<int> res = myask(i);
lc = res[0];
if(res[0] + res[1] == 0)
return i;
if (res[0] + res[1] > mxc) {
mxc = res[0] + res[1];
}
}
return gogo(0, n, 0, 0, mxc);
}
