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