Submission #455137

#TimeUsernameProblemLanguageResultExecution timeMemory
455137nonsensenonsense1Gap (APIO16_gap)C++17
30 / 100
46 ms1060 KiB
#include "gap.h" #include <cstdio> #include <algorithm> const long long N = 1000000000000000000; long long task1(int n) { long long l = 0, r = N, ans = 0; for (int i = 0; i * 2 < n; ++i) { long long ll, rr; MinMax(l, r, &ll, &rr); if (l) ans = std::max(ans, ll - l + 1); if (r != N) ans = std::max(ans, r - rr + 1); if (i * 2 == n - 2) ans = std::max(ans, rr - ll); l = ll + 1; r = rr - 1; } return ans; } long long findGap(int t, int n) { if (t == 1) return task1(n); return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...