# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
905343 | nightfal | 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.
int subtask1(int n){
int start=0, end=n-1;
while (start<end) {
int mid = (start+end)/2;
vector<int> ans = ask(mid);
if (!ans[0] && !ans[1]) return mid;
else if (!ans[0]) start=mid+1;
else end = mid-1;
}
return start;
}
int find_best(int n) {
return subtask1(n);
for(int i = 0; i < n; i++) {
std::vector<int> res = ask(i);
if(res[0] + res[1] == 0)
return i;
}
return 0;
}