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 <iostream>
#include <algorithm>
#include <cmath>
#include <vector>
using namespace std;
int nadji(int L, int D, int vall, int vald){
int mid=(L+D)/2;
vector < int > a=ask(mid);
if(!a[0] && !a[1]){
return mid;
}
if(a[0]){
return nadji(L, mid, vall, vald);
}
return nadji(mid+1, D, vall, vald);
}
int find_best(int n){
return nadji(0, n, 0, 0);
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |