Submission #249899

#TimeUsernameProblemLanguageResultExecution timeMemory
249899receedGap (APIO16_gap)C++14
0 / 100
78 ms1272 KiB
#include "gap.h" #include <vector> #include <algorithm> #include <iostream> using namespace std; using ll = long long; ll findGap(int t, int n) { ll l, r, x, y, ls; MinMax(0, 1'000000'000000'000000, &l, &r); ll ans = (r - l + n - 2) / (n - 1), d = ans; ls = l; for (int i = 0; i < n - 1; i++) { ll lp = l + 1 + d * i, rp = l + d * (i + 1); if (lp >= r) break; rp = min(rp, r); MinMax(lp, rp, &x, &y); ans = max(ans, x - ls); ls = y; } ans = max(ans, r - ls); return ans; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...