#include "ant.h"
int FindK(){
int ss = 1, ee = 99999999, ans = -1;
while(ss <= ee){
int mid = (ss+ee)/2;
int ret = DeliverCount(mid);
if(ret > 0){
ans = mid;
ee = mid - 1;
}else{
ss = mid + 1;
}
}
return ans;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Partially correct |
3 ms |
248 KB |
Partially correct : C = 27 |
2 |
Partially correct |
3 ms |
484 KB |
Partially correct : C = 27 |
3 |
Partially correct |
2 ms |
484 KB |
Partially correct : C = 27 |
4 |
Partially correct |
2 ms |
484 KB |
Partially correct : C = 27 |
5 |
Partially correct |
3 ms |
508 KB |
Partially correct : C = 27 |