Submission #1027521

#TimeUsernameProblemLanguageResultExecution timeMemory
1027521KasymKGap (APIO16_gap)C++17
30 / 100
40 ms1984 KiB
#include "bits/stdc++.h" #include "gap.h" using namespace std; #define pb push_back #define all(v) v.begin(), v.end() #define ll long long const int N = 1e5+5; ll a[N]; ll findGap(int t, int n){ if(t == 1){ ll l = 1, r = 1e18, id = 0, mn, mx, answer = 0; for(int i = 0; i < (n+1)/2; ++i){ MinMax(l, r, &mn, &mx); a[id++] = mn; a[id++] = mx; l = mn+1, r = mx-1; } sort(a, a+n); for(int i = 0; i < n-1; ++i) answer = max(answer, a[i+1]-a[i]); return answer; } return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...