# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
288965 | wdjpng | The Big Prize (IOI17_prize) | C++17 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "prize.h"
#define lint long long
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
int find_best(int n)
{
int oldSum = 1e9;
int curI = -1;
bool first=true;
while (true)
{
int start=-1, end=n;
while(end-start>1){
int cur = (start+end)/2;
vector<int>ans=ask(cur);
if(first){
first=false;
oldSum=ans[0]+ans[1];
}
if(ans[0]+ans[1]==0){return cur;}
if(ans[0]+ans[1]<oldSum){
oldSum=ans[0]+ans[1];
break;
}
else if(ans[0]) end=cur;
else start=cur;
}
}
assert(false);
}