#include "ant.h"
#include <math.h>
#include <algorithm>
#include <stdio.h>
using namespace std;
int FindK() {
int low = 1, high = 1e8, res = -1;
while(low <= high) {
int mid = (low + high) / 2;
if(low == 1 && high == 1e8) mid = (low + 2 * high) / 3;
int t = DeliverCount(mid);
if(t == 0) low = mid + 1;
else if(t == 1) {
res = mid;
high = mid - 1;
low = max(low, mid / 2 + 1);
}
else {
high = mid / 2;
}
}
return res;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
2 ms |
256 KB |
Correct |
2 |
Correct |
2 ms |
360 KB |
Correct |
3 |
Correct |
2 ms |
360 KB |
Correct |
4 |
Correct |
2 ms |
436 KB |
Correct |
5 |
Correct |
2 ms |
436 KB |
Correct |