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>
#define ll long long
using namespace std;
ll l,r,c,ma;
vector<int> v;
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;
if(res[0]+res[1]!=ma)
continue;
ma=max((ll)ma,(ll)(res[0]+res[1]));
l=i+1;
r=n-1;
while(l<=r)
{
c=(l+r)/2;
v=ask(c);
if(v[0]==res[0]&&v[1]==res[1])
{
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... |