Submission #1035522

#TimeUsernameProblemLanguageResultExecution timeMemory
1035522adrielcpGap (APIO16_gap)C++17
30 / 100
49 ms2016 KiB
#include <bits/stdc++.h> #include "gap.h" #define ll long long using namespace std; #define all(x) x.begin(), x.end() #define MAXN 1e18 ll a[100000], j = 0; long long findGap(int T, int N) { ll l = 1, r = MAXN; ll mn, mx; vector<ll> v; for (ll i = 0; i < (N + 1) / 2; i++) { MinMax(l, r, &mn, &mx); a[j++] = mn; a[j++] = mx; l = mn + 1, r = mx - 1; } sort(a, a + N); ll ans = 0; for (ll i = 0; i < N - 1; i++) ans = max(ans, a[i + 1] - a[i]); return ans; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...