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) {
// 20 points:
// 1 diamond
int low = 0,high = n-1;
int ans = -1;
while(low != high){
int mid = (low+high)/2;
vector<int> q = ask(mid);
if(q[0] == 1){
high = mid-1;
}else if(q[1] == 1){
low = mid+1;
}else{
ans = mid;
break;
}
}
return (ans == -1 ? low : ans);
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |