Submission #1123556

#	Time	Username	Problem	Language	Result	Execution time	Memory
1123556		hoainiem	Stove (JOI18_stove)	C++17	0 / 100	0 ms	324 KiB

stove

#include<bits/stdc++.h>
#define int long long
#define pb push_back
#define task "file"
using namespace std;
const int inf = 1e15;
const int mx = 2e5 + 5;
int n, k;
long long a[mx];
pair<long long,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 long l = 0, r = inf;
    long long ans;
    for (int t = 1; t <= 1000 && l < r; t++){
        long long mid = (l + r)/2;
        for (int i = 1; i <= n; i++){
            dp[i] = {0, 0};
        }
        dp[1] = {1.0 + mid, 1};
        for (int i = 2; i <= n; i++){
            dp[i] = min(make_pair(dp[i - 1].first + 1 + 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;
//            cout << dp[n].first << " " << dp[n].second << " " << mid << " " << l << " " << r << " " << ans << '\n';
            r = mid - 1;
        }else{
            l = mid + 1;
        }
    }
    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();
}

Compilation message (stderr)

stove.cpp: In function 'int main()':
stove.cpp:44:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   44 |         freopen(task".inp", "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
stove.cpp:45:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   45 |         freopen(task".out", "w", stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~

• Subtask 1: 0 / 20
• Subtask 2: 0 / 30
• Subtask 3: 0 / 50