Submission #160204

#TimeUsernameProblemLanguageResultExecution timeMemory
160204BlueDiamondGap (APIO16_gap)C++14
30 / 100
60 ms2040 KiB
#include <bits/stdc++.h> #include "gap.h" using namespace std; typedef long long ll; ll hidden[(int) 1e5 + 7]; ll findGap(int T, int N) { int i = 1, j = N; ll s = 0, t = (ll) 1e18; while (i <= j) { ll mn, mx; MinMax(s, t, &mn, &mx); hidden[i] = mn; hidden[j] = mx; s = mn + 1; t = mx - 1; i++; j--; } ll ans = 0; for (int i = 1; i < N; i++) ans = max(ans, hidden[i + 1] - hidden[i]); return ans; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...