Submission #804559

#TimeUsernameProblemLanguageResultExecution timeMemory
804559rnl42Colors (BOI20_colors)C++14
0 / 100
2388 ms208 KiB
#include <bits/stdc++.h> using namespace std; #define int long long int N; inline int getvalid(int N) { int mincur = 0, maxcur = 0; int cur = 0; int mini = 1, maxi = N-1; bool parity = false; while (mini <= maxi) { int mid = (mini+maxi)>>1; int next; if (!parity) { next = cur+mid; } else { next = cur-mid; } mini = mid+1; cur = next; parity ^= 1; mincur = min(mincur, cur); maxcur = max(maxcur, cur); } return -mincur; } inline bool query(int x) { cout << "? " << x+1 << '\n' << flush; bool ret; cin >> ret; return ret; } signed main() { //ios::sync_with_stdio(false), cin.tie(0), cout.tie(0); cin >> N; int cur = getvalid(N); int mini = 1, maxi = N-1; query(cur); bool parity = false; while (mini < maxi) { int mid = (mini+maxi+1)>>1; int next; if (!parity) { next = cur+mid; } else { next = cur-mid; } if (query(next)) { maxi = mid; } else { mini = mid+1; } parity ^= 1; cur = next; } cout << "= " << mini << '\n'; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...