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;
#define bug(x) cout << #x << " " << x << endl;
int bs( int n ){
int l = 0, r = n - 1;
while( l < r ){
int mid = ( l + r )/2;
vector<int> a = ask(mid);
if( a[0] == a[1] && a[0] == 0 ) return mid;
if( a[0] == 1 ) r = mid - 1;
else l = mid + 1;
}
return r;
}
int find_best(int n) {
return bs(n);
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |