# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1101682 | NoMercy | Colors (BOI20_colors) | C++14 | 2 ms | 592 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int ask (ll 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);
ll N;
cin >> N;
ll ind = 1, lo = 0, hi = N;
vector<ll> all;
map<ll, bool> used;
while (lo + 1 < hi) {
ll mid = (lo + hi) >> 1;
all.push_back(mid);
lo = mid;
}
reverse(all.begin(), all.end());
for (int i = 0;i < all.size();i ++) {
ind = ind + (ind + all[i] <= N ? all[i] : -all[i]);
}
used[ind] = 1;
ask (ind);
lo = 0;
hi = N;
while (lo + 1 < hi) {
ll mid = (lo + hi) >> 1;
// cout << lo << " " << mid << " " << hi << " " << ind << "\n";
if (ind - mid >= 1 && used[ind - mid] == false) {
if (ask (ind - mid) == 1) {
hi = mid;
} else {
lo = mid;
}
ind = ind - mid;
} else if (ind + mid <= N && used[ind + mid] == false) {
if (ask (ind + mid) == 1) {
hi = mid;
} else {
lo = mid;
}
ind = ind + mid;
} else {
if (ind - 1 >= N - ind) {
if (ask(1) == 1) {
hi = ind;
} else {
lo = ind;
}
ind = 1;
} else {
if (ask(N) == 1) {
hi = N - ind;
} else {
lo = N - ind;
}
ind = N;
}
}
used[ind] = true;
}
cout << "= " << hi << endl;
}
Compilation message (stderr)
# | 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... |