| # | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 71880 | :p (#119) | The Ant Doing Hard Work (FXCUP3_ant) | C++17 | 3 ms | 472 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 <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;
}
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||