Submission #1263903

#TimeUsernameProblemLanguageResultExecution timeMemory
1263903julia_08Gap (APIO16_gap)C++20
0 / 100
2097 ms1192 KiB
#include <bits/stdc++.h> #include "gap.h" using namespace std; using ll = long long; const int MAXN = 1e5 + 10; ll a[MAXN]; ll ans; int n; ll findGap(int t, int n){ ll cur_s = 0, cur_t = 1e18; ll mn, mx; MinMax(cur_s, cur_t, &mn, &mx); ans = (mx - mn + n - 2) / (n - 1); ll l = mn; while(l != mx){ ll n_mn, n_mx; MinMax(l + 1, l + ans + 1, &n_mn, &n_mx); ans = max(ans, n_mn - l); l = n_mx; } return ans; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...