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