# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1029831 | 2024-07-21T11:44:48 Z | stdfloat | Gap (APIO16_gap) | C++17 | 0 ms | 0 KB |
#include <bits/stdc++.h> #include "gap.h" #include "grader.cpp" using namespace std; using ll = long long; ll findGap(int T, int n) { ll s, t; MinMax(0, (ll)1e18, &s, &t); ll d = (t - s - 1) / (n - 1), mx = 0, a = s; while (s + 1 < t) { ll x, y; MinMax(s + 1, min(s + d, t - 1), &x, &y); if (x != -1) { mx = max(mx, x - a); a = y; } s += d; } return max(mx, t - a); }