제출 #921869

#제출 시각아이디문제언어결과실행 시간메모리
921869lamterGap (APIO16_gap)C++17
0 / 100
19 ms5584 KiB
#include "gap.h" #include <bits/stdc++.h> const long long iii = 1E18; void MyMinMax(long long x, long long y, long long& min, long long& max) { long long* min_place_holder = nullptr; long long* max_place_holder = nullptr; MinMax(x, y, min_place_holder, max_place_holder); min = *min_place_holder; max = *max_place_holder; } long long findGap(int T, int n) { if (T == 1) { std::vector <long long> a(n); MyMinMax(0, iii, a[0], a[n - 1]); for (int l = 1, r = n - 2; l <= r; l += 1, r -= 1) { MyMinMax(a[l - 1] + 1, a[r + 1] - 1, a[l], a[r]); } long long int ans = iii; for (int i = 0; i + 1 < n; i += 1) ans = std::min(ans, a[i + 1] - a[i]); return ans; } assert(0); }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...