Submission #866587

#TimeUsernameProblemLanguageResultExecution timeMemory
866587maks007Stove (JOI18_stove)C++14
0 / 100
1 ms348 KiB
#include "bits/stdc++.h" using namespace std; //#define int long long signed main () { int n, k; cin >> n >> k; vector <int> a(n); for(int i = 0; i < n; i ++) cin >> a[i]; function <int(int,int)> good=[&](int x, int opt) { int cnt = 1, ff = a[0], ans = 0; for(int i = 1; i < n; i ++) { if(a[i]-ff > x) { cnt ++; ans += a[i-1]-ff+1; ff = a[i]; } } ans += a[n-1]-ff+1; if(opt) return ans; if(cnt <= k) return 1; return 0; }; int l = 0, r = 1e9; while(l < r) { int mid = (l + r) / 2; if(good(mid, 0)) r = mid; else l = mid + 1; } cout << good(r, 1); return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...