# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
289170 | Bill_00 | The Big Prize (IOI17_prize) | C++14 | 88 ms | 1400 KiB |
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 ans,m;
void search(int mid,int l,int r){
vector<int>res=ask(mid);
if(res[0]+res[1]==0){
ans=mid;
return;
}
if(l==r){
return;
}
if(res[1]==0){
search((mid-1+l)>>1,l,mid-1);
}
if(res[0]==0){
search(mid+1+r>>1,mid+1,r);
}
if(res[1]!=0 && res[0]!=0){
search((l+mid-1)/2,l,mid-1);
search((mid+1+r)/2,mid+1,r);
}
}
int find_best(int n){
m=n;
/*for(int i = 0; i < n; i++) {
std::vector<int> res = ask(i);
if(res[0] + res[1] == 0)
return i;
}*/
int l=0,r=n-1;
int mid=(l+r)>>1;
search(mid,l,r);
return ans;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |