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