#include "ant.h"
#include <stdio.h>
#include <algorithm>
using namespace std;
int FindK() {
int s=1,e=1e8,m;
while(s<=e){
m=(s+e)>>1;
if(DeliverCount(m)) e=m-1;
else s=m+1;
}
return s;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Partially correct |
3 ms |
256 KB |
Partially correct : C = 27 |
2 |
Partially correct |
2 ms |
376 KB |
Partially correct : C = 27 |
3 |
Partially correct |
3 ms |
424 KB |
Partially correct : C = 27 |
4 |
Partially correct |
2 ms |
424 KB |
Partially correct : C = 27 |
5 |
Partially correct |
2 ms |
424 KB |
Partially correct : C = 27 |