| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 467651 | SirCovidThe19th | Gap (APIO16_gap) | C++17 | 0 ms | 0 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 <bits/stdc++.h>
#include "gap.h"
using namespace std;
#define ll long long
ll findGap(ll t, ll n){
ll mn, mx, lim, lb, ans = 0;
MinMax(1, 1e18, &mn, &mx);
lb = (mx - mn) / (n - 1); lim = mx;
for (ll l = mn, r = mn + lb - 1, prvMx = 1e18; l < lim; l += lb, r += lb){
MinMax(l, r, &mn, &mx);
ans = max(ans, mn - prvMx);
if (~mx) prvMx = mx;
}
return ans;
}