제출 #1279035

#제출 시각아이디문제언어결과실행 시간메모리
1279035IBoryGap (APIO16_gap)C++20
0 / 100
2110 ms589824 KiB
#include "gap.h" #include <bits/stdc++.h> typedef long long ll; using namespace std; ll findGap(int T, int N) { vector<ll> A; if (T == 1) { ll l = 0, r = 1e18; while (1) { MinMax(l, r, &l, &r); if (l == -1) break; A.push_back(l); A.push_back(r); } } else { ll l = 0, r = 1e18; MinMax(l, r, &l, &r); A.push_back(l); A.push_back(r); if (N != 2) { ll t = (r - l + N - 2) / (N - 1); for (ll i = 0; i < N - 1; ++i) { ll tl = l + t * i, tr = l + t * (i + 1) - 1; ll a, b; MinMax(tl, tr, &a, &b); if (a != -1) { A.push_back(a); A.push_back(b); } } } } ll ret = 0; sort(A.begin(), A.end()); for (int i = 1; i < A.size(); ++i) ret = max(ret, A[i] - A[i - 1]); return ret; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...