# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
71857 | 2018-08-25T17:24:04 Z | 비타오백(#2241, junodeveloper) | The Ant Doing Hard Work (FXCUP3_ant) | C++17 | 0 ms | 0 KB |
#include "ant.h" int FindK() { int lo = 1, hi = 1e8; int f = 0; while(lo < hi) { int mid = (lo + hi) / 2; if(!f) f = 1, mid = (1<<26)-1; int x = DeliverCount(mid); if(!x) lo = mid + 1; else { lo = max(lo, (mid+x)/(x+1)); hi = min(hi, mid/x); } } return lo; }