# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
71727 | 2018-08-25T13:43:03 Z | chobo(#2238, andy627) | The Ant Doing Hard Work (FXCUP3_ant) | C++ | 4 ms | 488 KB |
#include "ant.h" #include <stdio.h> #include <algorithm> using namespace std; int FindK() { int s=1,e=1e8-1,m=1e8/3*2; while(s<=e){ int res=DeliverCount(m); if(res){ s=max(s,m/(res+1)+1); e=min(e,m/res-1); } else s=m+1; m=(s+e)>>1; } return s; }
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 3 ms | 248 KB | Correct |
2 | Correct | 3 ms | 488 KB | Correct |
3 | Correct | 4 ms | 488 KB | Correct |
4 | Correct | 2 ms | 488 KB | Correct |
5 | Correct | 4 ms | 488 KB | Correct |