#include "ant.h"
#include <bits/stdc++.h>
using namespace std;
int FindK()
{
int l = 1, r = 99999999;
int res = 99999999;
vector<pair<int, int>> logs;
while(l<=r)
{
int t = (l+r)/2;
int cnt = DeliverCount(t);
logs.push_back({t, cnt});
if(cnt > 0)
{
res = min(res, t);
r = t - 1;
} else l = t + 1;
}
return res;
}
# |
결과 |
실행 시간 |
메모리 |
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 |
356 KB |
Partially correct : C = 27 |
4 |
Partially correct |
3 ms |
472 KB |
Partially correct : C = 27 |
5 |
Partially correct |
2 ms |
472 KB |
Partially correct : C = 27 |