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