이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
const int mxN = 1e5 + 5;
ll n,dis[mxN];
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
ll ans;
cin >> n;
ll l = 0, r = n,idx = 0;
while(r > l + 1){
ll mid = l + (r - l) / 2;
dis[idx++] = mid;
l = mid;
}
ll dis1 = 0;
for(int i = 1; i < idx; i += 2) dis1 += dis[i] - dis[i - 1];
ll curr = dis1 + 1,xx = 0;
cout << "? " << curr << endl;
cin >> ans;
l = 0, r = n;
while(r > l + 1){
ll mid = l + (r - l) / 2;
curr += mid * ((xx % 2 > 0) ? (-1) : (1));
cout << "? " << curr << endl;
cin >> ans;
if(!ans) l = mid;
else r = mid;
xx++;
}
cout << "= " << r << 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... |