Submission #1215008

#TimeUsernameProblemLanguageResultExecution timeMemory
1215008kunzaZa183Gap (APIO16_gap)C++20
30 / 100
43 ms6852 KiB
#include "gap.h" #include <bits/stdc++.h> using namespace std; using ll = long long; long long findGap(int T, int N) { if (T == 1) { set<ll> si; ll l = 0, r = 1e18; for (int i = 0; i < (N + 1) / 2; i++) { ll a, b; MinMax(l, r, &a, &b); if (a != -1) si.insert(a); if (b != -1) si.insert(b); l = a + 1, r = b - 1; } vector<ll> vi; for (auto a : si) vi.push_back(a); ll maxi = 0; for (int i = 1; i < vi.size(); i++) maxi = max(maxi, vi[i] - vi[i - 1]); return maxi; } else { ll mini, maxi; MinMax(0, 1e18, &mini, &maxi); ll x = (maxi - mini + N - 2) / (N - 1); ll curl = mini; ll ans = x; ll a, b; for (ll i = mini; i < maxi; i += x + 1) { MinMax(i, i + x, &a, &b); ans = max(ans, a - curl); curl = b; } return ans; } }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...