제출 #1280253

#제출 시각아이디문제언어결과실행 시간메모리
1280253thundraxGap (APIO16_gap)C++20
30 / 100
36 ms3236 KiB
#include <bits/stdc++.h> #include "gap.h" using namespace std; long long findGap(int T, int N) { long long mn, mx; long long l = 0, r = 1e18; vector<long long> v; for (int i = 0; i < (N + 1) / 2; i++) { MinMax(l, r, &mn, &mx); v.push_back(mn); v.push_back(mx); l = mn + 1; r = mx - 1; } sort(v.begin(), v.end()); long long ans = 0; for (int i = 0; i+1 < v.size(); i++) ans = max(ans, v[i + 1] - v[i]); return ans; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...