Submission #1085044

#TimeUsernameProblemLanguageResultExecution timeMemory
1085044TimoshGap (APIO16_gap)C++17
42.88 / 100
58 ms5964 KiB
#include <bits/stdc++.h> #include "gap.h" using namespace std; long long mn = 0, mx = 0; set<long long> st; void gen(long long l, long long r) { if (l > r) return; MinMax(l, r, &mn, &mx); if (mn == -1) return; st.insert(mn); st.insert(mx); if (mn == mx) return; l = mn + 1, r = mx - 1; long long m = l + (r - l) / 2; gen(l, m); gen(m + 1, r); } long long findGap(int T, int N) { long long ans = 1; if (T == 2) { gen(0, 1e18); } else { long long l = 0, r = 1e18; while (1) { MinMax(l, r, &mn, &mx); if (mn == -1) break; st.insert(mn); st.insert(mx); l = mn + 1, r = mx - 1; if (mn == mx || (long long)st.size() >= N) break; } } long long last = *st.begin(); for (auto &i : st) ans = max(ans, i - last), last = i; return ans; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...