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>
using namespace std;
int main()
{
int n{};
cin>>n;
int last{n}, query{n}, reply{};
pair<int,int> bound{1,n};
cout<<"? "<<query;
cin>>reply;
query/=2;
while(bound.first!=bound.second && query>=1 && query<=n)
{
cout<<"? "<<query;
cin>>reply;
if(reply==1)
{
bound.second = abs(last-query);
last = query;
query-=(bound.first+bound.second-1)/2;
}
else
{
bound.first = abs(last-query)+1;
last = query;
query+=(bound.first+bound.second-1)/2;
}
}
cout<<"= "<<bound.first;
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |