Submission #400075

#TimeUsernameProblemLanguageResultExecution timeMemory
400075dxz05Gap (APIO16_gap)C++14
55.47 / 100
79 ms1232 KiB
#include "gap.h" #include <bits/stdc++.h> using namespace std; const int MAXN = 555555; const long long INF = 1e18 + 2e2; typedef long long ll; ll a[MAXN]; long long findGap(int SUBTASK, int n){ ll mn, mx; MinMax(0, INF, &mn, &mx); a[1] = mn; a[n] = mx; ll x = (mx - mn + n - 2) / (n - 1); ll ans = x; ll l = mn, last = mn; while (l <= a[n]){ MinMax(l + 1, l + x, &mn, &mx); if (mn == -1){ l += x; } else { ans = max(ans, mn - last); l = last = mx; } } return ans; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...