Submission #1144320

#TimeUsernameProblemLanguageResultExecution timeMemory
1144320THXuanGap (APIO16_gap)C++20
100 / 100
39 ms2240 KiB
#include "gap.h" #include<bits/stdc++.h> using namespace std; typedef long long ll; const ll MAXN = 1e18; long long findGap(int T, int N) { if (T == 1) { ll l = 0, r = 1e18; vector<ll>a; while (a.size() < N) { ll mn, mx; MinMax(l, r, &mn, &mx); a.push_back(mn); if (mn == mx)break; a.push_back(mx); l = mn + 1; r = mx - 1; if (a.size() == N)break; } ll ans = 0; sort(a.begin(), a.end()); for (int i = 0; i + 1 < N; i++)ans = max(ans, a[i + 1] - a[i]); return ans; } else { ll mn, mx; MinMax(1, MAXN, &mn, &mx); ll step = (mx - mn + N - 2) / (N - 1); ll ans = step, x, y, l = mn, i; for (i = mn; i + step < mx; i += step + 1) { MinMax(i, i + step, &x, &y); if (x != -1) { ans = max(ans, x - l); l = y; } } MinMax(i, mx, &x, &y); if (x != -1) ans = max(ans, x - l); return ans; } }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...