# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
71933 | 블랙야크 (#119) | The Ant Doing Hard Work (FXCUP3_ant) | C++17 | 2 ms | 436 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#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;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |