#include "ant.h"
int FindK() {
int lo = 1;
int hi = 100000000 - 1;
while(lo < hi){
int mid = (lo + hi) >> 1;
if (DeliverCount(mid))hi = mid;
else lo = mid + 1;
}
return lo;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Partially correct |
2 ms |
248 KB |
Partially correct : C = 27 |
2 |
Partially correct |
2 ms |
356 KB |
Partially correct : C = 27 |
3 |
Partially correct |
3 ms |
432 KB |
Partially correct : C = 27 |
4 |
Partially correct |
2 ms |
508 KB |
Partially correct : C = 27 |
5 |
Partially correct |
2 ms |
544 KB |
Partially correct : C = 27 |