#include <bits/stdc++.h>
using namespace std;
#define int long long
void BinSrch(int l, int r, int cnt, int ans) {
int f = 0;
while(l <= r) {
int response;
if(cnt % 2 == 0) {
cout << "? " << l++ << endl;
}
else {
cout << "? " << r-- << endl;
}
cnt++;
cin >> response;
if(cnt == 1)
continue;
if(response == 1) {
ans = min(ans, r - l + 2);
}
else {
cout << "= " << ans << endl;
f = 1;
break;
}
}
if(f == 0) {
cout << "= " << ans << endl;
}
//cout << "cnt of queries = " << cnt << endl;
}
void Solve() {
int n;
cin >> n;
if(n == 64) {
BinSrch(1, 64, 0, 64);
return;
}
int l = 1, r = n, ans = n;
cout << "? 64" << endl;
int response;
cin >> response;
cout << "? 128" << endl;
cin >> response;
if(response == 1) {
l = 65, r = 127, ans = 64;
}
else {
l = 1, r = 127;
}
BinSrch(l, r, 2, ans);
}
int32_t main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
Solve();
return 0;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Runtime error |
1 ms |
232 KB |
Execution killed with signal 13 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Runtime error |
1 ms |
232 KB |
Execution killed with signal 13 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Runtime error |
1 ms |
232 KB |
Execution killed with signal 13 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Runtime error |
1 ms |
232 KB |
Execution killed with signal 13 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Runtime error |
1 ms |
232 KB |
Execution killed with signal 13 |
2 |
Halted |
0 ms |
0 KB |
- |