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 find_best(int n) {
int l = 0; int r = n-1;
while (r >= l){
int mid = (l+r)/2;
vector<int> res = ask(mid);
if (res[0] + res[1] == 0) return mid;
if (res[0] > 0) r = mid-1;
if (res[1] > 0) l = mid+1;
}
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |