제출 #1155684

#제출 시각아이디문제언어결과실행 시간메모리
1155684blackslexGap (APIO16_gap)C++20
0 / 100
34 ms2336 KiB
#include "gap.h" #include<bits/stdc++.h> using namespace std; using ll = long long; long long findGap(int T, int N) { int n = N; if (T == 1) { vector<ll> a; ll mn = -1, mx = 1e18 + 1; for (int i = 0; ; i++) { MinMax(mn + 1, mx - 1, &mn, &mx); if (mn == mx) a.emplace_back(mn); else { a.emplace_back(mn); a.emplace_back(mx); } if (a.size() == n) break; } sort(a.begin(), a.end()); ll ans = 0; for (int i = 0; i < a.size() - 1; i++) ans = max(ans, a[i + 1] - a[i]); return ans; } return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...