#include <bits/stdc++.h>
#include "ant.h"
using namespace std;
int FindK(){
int l=0; int r=1e8-1;
while(l<r){
int mid=(l+r)/2;
if(DeliverCount(mid)) r=mid;
else l=mid+1;
}
return l;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Partially correct |
3 ms |
248 KB |
Partially correct : C = 27 |
2 |
Partially correct |
3 ms |
388 KB |
Partially correct : C = 27 |
3 |
Partially correct |
3 ms |
440 KB |
Partially correct : C = 27 |
4 |
Partially correct |
2 ms |
440 KB |
Partially correct : C = 27 |
5 |
Partially correct |
2 ms |
440 KB |
Partially correct : C = 27 |