제출 #986778

#제출 시각아이디문제언어결과실행 시간메모리
986778siewjhGap (APIO16_gap)C++17
100 / 100
47 ms2860 KiB
#include "gap.h" #include <bits/stdc++.h> using namespace std; typedef long long ll; ll cdiv(ll a, ll b){ return (a + b - 1) / b; } ll findGap(int T, int N){ if (T == 1){ vector<ll> vec(N); ll lv = 0, rv = 1e18, ans = 0; for (int l = 0, r = N - 1; l <= r; l++, r--){ MinMax(lv, rv, &vec[l], &vec[r]); lv = vec[l] + 1; rv = vec[r] - 1; } for (int i = 1; i < N; i++) ans = max(ans, vec[i] - vec[i - 1]); return ans; } else{ ll mn, mx; MinMax(0, 1e18, &mn, &mx); ll gap = cdiv(mx - mn, N - 1), prv = mn, ans = 0; for (ll x = mn + 1; x <= mx; x += gap){ ll mnh, mxh; MinMax(x, min(x + gap - 1, mx), &mnh, &mxh); if (mnh == -1) continue; ans = max(ans, mnh - prv); prv = mxh; } return ans; } }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...