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 <bits/stdc++.h>
#include "prize.h"
#define ff first
#define ss second
using namespace std;
int l,r,md,ans;
int find_best(int n) {
if(n <= 20){
l=0,r=n-1,ans=n-1;
while(l <= r){
md=(l+r)/2;
vector<int> jog = ask(md);
if(jog[0]==0 and jog[1]==0) return md;
if(jog[0] < jog[1]) l=md+1;
else r=md-1;
}
}
return rand()%n;
}
| # | Verdict | Execution time | Memory | Grader output |
|---|
| Fetching results... |
| # | Verdict | Execution time | Memory | Grader output |
|---|
| Fetching results... |