| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 941131 | PenguinsAreCute | Semiexpress (JOI17_semiexpress) | C++17 | 0 ms | 348 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
#define int long long
main() {
int n, m, k, a, b, c, t; cin >> n >> m >> k >> a >> b >> c >> t;
int s[m]; for(int i=0;i<m;i++) cin>>s[i];
vector<int> v;
int ans = 0;
for(int i=0;i<m-1;i++) {
int cur = s[i];
while(cur < s[i+1]) {
int nxt = (cur * (a-c) + s[i] * (c-b) + t) / a + 1;
if(nxt <= cur) break;
nxt = min(nxt, s[i+1]);
if(cur == s[i]) ans += (nxt - cur);
else v.push_back(nxt-cur);
cur = nxt;
}
}
sort(v.begin(),v.end());
for(int i=1;i<=min((int)(v.size()),k-m);i++) ans += end(v)[-i];
cout << ans;
}Compilation message (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... | ||||
