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