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"
#include<bits/stdc++.h>
using namespace std;
int l,r,c,ma;
int find_best(int n) {
for(int i = 0; i < n; i++) {
std::vector<int> res = ask(i);
if(res[0] + res[1] == 0)
return i;
ma=max(ma,res[0]+res[1]);
if(res[0]+res[1]<ma)
continue;
l=i;
r=n-1;
while(l<=r)
{
c=(l+r)/2;
vector<int> hv=ask(c);
if(hv==res)
{
i=c;
l=c+1;
}
else
r=c-1;
}
}
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |