| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1012075 | zsombor | Gap (APIO16_gap) | C++17 | 42 ms | 2684 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 "gap.h"
#include <vector>
using namespace std;
using ll = long long;
const ll m = 1000000000000000000;
ll solve1(ll n) {
ll l = 0, r = m, mn, mx, ans = 0;
vector <ll> v;
vector <ll> v2;
while (v.size() + v2.size() < n) {
MinMax(l, r, &mn, &mx);
l = mn + 1;
r = mx - 1;
v.push_back(mn);
v2.push_back(mx);
}
while (v2.size()) { v.push_back(v2.back()); v2.pop_back(); }
for (int i = 1; i < v.size(); i++) ans = max(ans, v[i] - v[i - 1]);
return ans;
}
ll solve2(ll n) {
ll a1, an, mn, mx, ans = 0;
MinMax(0, m, &a1, &an);
ll u = a1, d = a1, l = (an - a1) / (n - 1);
if (l * (n - 1) < an - a1) l++;
while (d < an) {
MinMax(d + 1, d + l, &mn, &mx);
d += l;
if (mn == -1) continue;
ans = max(ans, mn - u);
u = mx;
}
return ans;
}
ll findGap(int T, int N) {
return (T == 1 ? solve1(N) : solve2(N));
}Compilation message (stderr)
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
