# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
71697 | 2018-08-25T11:36:01 Z | team(#2232, comfile) | The Ant Doing Hard Work (FXCUP3_ant) | C++ | 4 ms | 248 KB |
#include <bits/stdc++.h> #include "ant.h" using namespace std; int FindK(){ int l=1; int r=1e8-1; while(l+1<r){ int mid=(l+r)/2; int tmp=DeliverCount(mid); if(tmp){ r=mid/tmp; l=max(mid/(tmp+1)+1,l); } else l=mid+1; } return l; }
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Runtime error | 4 ms | 248 KB | Execution failed because the return code was nonzero |
2 | Halted | 0 ms | 0 KB | - |