# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
71678 | 2018-08-25T11:04:57 Z | team(#2232, comfile) | The Ant Doing Hard Work (FXCUP3_ant) | C++ | 4 ms | 620 KB |
#include <bits/stdc++.h> #include "ant.h" using namespace std; int FindK(){ int l=1; int r=1e8-1; while(l<r){ int mid=(l+r)/2; int tmp=DeliverCount(mid); if(tmp) r=mid/tmp; else l=mid+1; } return l; }
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Partially correct | 4 ms | 376 KB | Partially correct : C = 27 |
2 | Partially correct | 3 ms | 488 KB | Partially correct : C = 27 |
3 | Correct | 4 ms | 552 KB | Correct |
4 | Partially correct | 2 ms | 620 KB | Partially correct : C = 27 |
5 | Correct | 3 ms | 620 KB | Correct |