# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
426677 | Hazem | The Big Prize (IOI17_prize) | C++14 | 47 ms | 324 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) {
int l = 0,r = n-1;
while(l<r){
int mid = (l+r)/2;
vector<int>vec = ask(mid);
if(!vec[0])l = mid;
if(!vec[1])r = mid;
}
return l;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |