Submission #895844

#TimeUsernameProblemLanguageResultExecution timeMemory
895844MackerHotter Colder (IOI10_hottercolder)C++17
80 / 100
445 ms8280 KiB
#include <bits/stdc++.h> #include "grader.h" using namespace std; int HC(int N){ int l = 1, r = N, mid; int ask = max(N / 2, 1); Guess(ask); while(l < r){ int nask = min(max(l + r - ask, 1), N); if(nask == ask) nask++; if(nask > N) nask = N - (ask == N); mid = (ask + nask) / 2; int g = Guess(nask); if(ask > nask) g = -g; if(g == 1) l = mid + 1; else if(g == -1){ if((ask + nask) % 2 == 0) r = mid - 1; else r = mid; } else return (ask + nask) / 2; ask = nask; } return l; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...