Submission #1278389

#TimeUsernameProblemLanguageResultExecution timeMemory
1278389LithaniumGap (APIO16_gap)C++20
70 / 100
45 ms3324 KiB
#include "gap.h" #include <bits/stdc++.h> using namespace std; using ll = long long; long long findGap(int T, int N) { // Step 1, find A1 and An ll l, r; MinMax(0, 1e18, &l, &r); ll sz = (r-l+N-2)/(N-1); vector<ll> relevant = {l, r}; for (ll i = l+1; i < r; i += sz) { // l = i, r = i+sz-1; ll l1, r1; MinMax(i, i+sz-1, &l1, &r1); if (l1 != -1) relevant.push_back(l1), relevant.push_back(r1); } sort(relevant.begin(), relevant.end()); ll ans = 0; for (int i = 0; i+1 < relevant.size(); i ++) ans = max(ans, relevant[i+1] - relevant[i]); return ans; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...