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