이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define all(x) (x).begin(),(x).end()
int32_t main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n;
cin>>n;
int left = 1, right = n, query = n, outcome, last_asked = 1;
cout<<"? 1"<<endl;
cin>>outcome;
while(left < right){
cout<<"? "<<query<<endl;
cin>>outcome;
if(outcome)
right = abs(query-last_asked);
else
left = abs(query-last_asked) + 1;
int mid = left + (right-left)/2;
last_asked = query;
if(query + mid <= n){
query = query + mid;
}
else if(query - mid >= 1){
query = query - mid;
}
else{
query = 1;
}
}
cout<<"= "<<right<<'\n';
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... |