# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
423704 | AugustinasJucas | The Big Prize (IOI17_prize) | C++14 | 0 ms | 0 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 <bits/stdc++.h>
//#include "prize.h"
using namespace std;
int find_best(int n) {
int l = 0; int r = n-1;
while(l <= r){
int mid = (l + r) / 2;
auto f = ask(mid);
if(f[0] == 0 && f[1] == 0) return mid;
if(f[0] == 1){
r = mid-1;
}else{
l = mid+1;
}
}
return 0;
}