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