#include<stdio.h>
#include "ant.h"
int FindK() {
int l=0,r=100000000;
while(l<r-1){
int mid=(l+r)/2;
if(DeliverCount(mid)==0){
l=mid;
}
else r=mid;
}
return r;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Partially correct |
2 ms |
256 KB |
Partially correct : C = 27 |
2 |
Partially correct |
2 ms |
360 KB |
Partially correct : C = 27 |
3 |
Partially correct |
2 ms |
444 KB |
Partially correct : C = 27 |
4 |
Partially correct |
2 ms |
468 KB |
Partially correct : C = 27 |
5 |
Partially correct |
2 ms |
468 KB |
Partially correct : C = 27 |