# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
670058 | GrandTiger1729 | Semiexpress (JOI17_semiexpress) | C++17 | 14 ms | 3532 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 <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main(){
cin.tie(0)->sync_with_stdio(0);
long long n;
int m, k;
cin >> n >> m >> k;
long long A, B, C;
cin >> A >> B >> C;
long long T; cin >> T;
vector<long long> a(m);
for (int i = 0; i < m; i++){
cin >> a[i];
}
k -= m;
vector<long long> res;
res.reserve((m - 1) * (k + 1));
long long ans = 0;
for (int i = 0; i < m - 1; i++){
if (T - B * (a[i] - a[0]) < 0){
break;
}
long long cur = min((T - B * (a[i] - a[0])) / A, a[i + 1] - a[i] - 1);
ans += 1 + cur;
for (int j = 1; j <= k; j++){
if (T - B * (a[i] - a[0]) - C * (cur + 1) < 0 || a[i + 1] - a[i] - (cur + 1) - 1 < 0){
break;
}
res.push_back(min((T - B * (a[i] - a[0]) - C * (cur + 1)) / A, a[i + 1] - a[i] - (cur + 1) - 1));
cur += res.back() + 1;
}
}
if (T - B * (a[m - 1] - a[0]) >= 0){
ans++;
}
sort(res.begin(), res.end(), greater<long long>());
if (res.size() > k)
res.resize(k);
for (int i = 0; i < res.size(); i++){
ans += res[i] + 1;
}
cout << ans - 1;
return 0;
}
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... |