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