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