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