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"
using namespace std;
int ans, N;
void rec(int l, int r){
if (l < 0 || r > N || l > r)
return ;
else{
int mid = (l + r)/2;
//cout << l << " " << r << " " << mid << "\n";
vector <int> q = ask(mid);
if (q[0] > 0)
rec(l, mid - 1);
if (q[1] > 0)
rec(mid + 1, r);
if (q[0] == 0 && q[1] == 0)
ans = mid;
}
}
int find_best(int n) {
N = n;
rec(0, n - 1);
return ans;
}
| # | Verdict | Execution time | Memory | Grader output |
|---|
| Fetching results... |
| # | Verdict | Execution time | Memory | Grader output |
|---|
| Fetching results... |