이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll fS(ll x){
ll lo = 1, hi = x, cn = 0, ans = 0, out = 0;
while(lo <= hi){
if(cn&1)ans-=(lo+hi)/2;
else ans +=(lo+hi)/2;
lo = (lo+hi)/2+1;
out = min(out, ans);
cn++;
}
return out;
}
int main(){
ll n; cin >> n;
ll start = -fS(n)+1;
cout << "? " << start << endl;
ll tr; cin >> tr;
ll lo = 1, hi = n, best = n, cn = 0, ans = start, x;
while(lo <= hi && lo != n){
int mid = (lo+hi)/2;
if(cn&1)ans-=mid;
else ans+=mid;
cout << "? " << ans << endl;
cin >> x;
if(x){
best = mid;
hi = mid-1;
}
else{
lo = mid+1;
}
cn++;
}
cout << "= " << best << endl;
}
# | 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... |