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