# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
126484 | chubyxdxd | The Big Prize (IOI17_prize) | C++11 | 89 ms | 380 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 find_best(int n) {
vector<int> v;
int i=1;
int low=0,hi=n,mid;
int j=(hi+low)/2;
while(i<=500){
low=0;
hi=n;
while(hi-low>1)
{
v.clear();
mid=j;
v=ask(mid);
if(v[0]==0 and v[1]==0){
return mid;
break;
}
if(v[0]<v[1]){
low=mid;
}
else{
hi=mid;
//j=low+hi/2;
}
j=(low+hi)/2;
}
i++;
v=ask(j);
if(v[0]==0 and v[1]==0){
return j;
}
v.clear();
}
return mid;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |