# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
1123550 | hoainiem | Stove (JOI18_stove) | C++20 | 1 ms | 328 KiB |
#include<bits/stdc++.h>
#define int long long
#define pb push_back
#define task "file"
using namespace std;
const int inf = 1e18;
const int mx = 2e5 + 5;
int n, k;
long double a[mx];
pair<long double,int> dp[mx];
void read(){
cin >> n >> k;
for (int i = 1; i <= n; i++){
cin >> a[i];
}
sort(a + 1, a + n + 1);
}
void solve(){
long double l = 0, r = inf;
long double ans;
for (int t = 1; t <= 1000; t++){
long double mid = (l + r)/2;
for (int i = 1; i <= n; i++){
dp[i] = {0, 0};
}
dp[1] = {1, 1};
for (int i = 2; i <= n; i++){
dp[i] = min(make_pair(dp[i - 1].first + 1.0 + mid, dp[i - 1].second + 1), make_pair(dp[i - 1].first + a[i] - a[i - 1], dp[i - 1].second));
}
if (dp[n].second <= k){
ans = dp[n].first - mid * (dp[n].second - 1);
// cout << dp[n].first << " " << dp[n].second << " " << mid << " " << l << " " << r << " " << ans << '\n';
r = mid;
}else{
l = mid;
}
}
cout << ans;
}
signed main(){
cin.tie(0)->sync_with_stdio(0);
if(fopen(task".inp", "r")){
freopen(task".inp", "r", stdin);
freopen(task".out", "w", stdout);
}
read();
solve();
}
컴파일 시 표준 에러 (stderr) 메시지
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |