# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
62577 | 2018-07-29T08:00:16 Z | imsifile | The Ant Doing Hard Work (FXCUP3_ant) | C++14 | 3 ms | 392 KB |
#include "ant.h" int mi=1, mx=99999999, md, dap; int FindK() { int fir = DeliverCount(66666666); mi = 66666666/(fir+1)+1; if(fir) mx = 66666666/fir; while(1){ md = (mi+mx)/2; if(mi==mx) break; int C = DeliverCount(md); if(C) mx=md; else mi=md+1; } return md; }
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 248 KB | Correct |
2 | Correct | 2 ms | 356 KB | Correct |
3 | Correct | 3 ms | 392 KB | Correct |
4 | Correct | 2 ms | 392 KB | Correct |
5 | Correct | 2 ms | 392 KB | Correct |