# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
71736 | 2018-08-25T13:53:06 Z | 본대회 참가못해요 흑흑(#2224, moonrabbit2) | The Ant Doing Hard Work (FXCUP3_ant) | C++ | 4 ms | 476 KB |
#include "ant.h" #include <bits/stdc++.h> using namespace std; int l=1,r=1e8-1,ans=r; int FindK() { while(l<=r){ int m=(l+r)/2; if(l==1&&r==1e8-1) m=67108864; int v=DeliverCount(m); if(v==0) l=m+1; else{ if(v==1) ans=min(ans,m); r=min(m-1,m/v); l=max(l,m/(v+1)+1); } } return ans; }
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 4 ms | 376 KB | Correct |
2 | Correct | 4 ms | 476 KB | Correct |
3 | Correct | 3 ms | 476 KB | Correct |
4 | Correct | 2 ms | 476 KB | Correct |
5 | Correct | 3 ms | 476 KB | Correct |