| # | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 71902 | :p (#119) | The Ant Doing Hard Work (FXCUP3_ant) | C++17 | 3 ms | 248 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;
int steps = 26;
while(l<=r && steps > 0)
{
steps--;
// cout << l << ' ' << r << ' ' << res << endl;
int t = (l+r+1)/2;
int p = 99999999 / t;
int cnt = DeliverCount(t*p);
logs.push_back({t*p, cnt});
if(cnt >= p)
{
res = min(res, t);
r = t - 1;
} else l = t + 1;
}
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||