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 m = (l + r) / 2;
vector<int> ans = ask(m);
cout << "q" << endl;
cout << ans[0] << " " << ans[1] << endl;
cout << l << " " << r << endl;
if(ans[0]){
r = m - 1;
}else if(ans[1]){
l = m + 1;
}else{
return m;
}
}
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |