#include <bits/stdc++.h>
using namespace std;
#define int long long
mt19937_64 RNG(chrono::steady_clock::now().time_since_epoch().count());
void Solve() {
int n, m, k;
cin >> n >> m >> k;
int a, b, c;
cin >> a >> b >> c;
int maxTim;
cin >> maxTim;
int express[m + 1];
for(int i = 1; i <= m; i++) {
cin >> express[i];
}
int curAns = 0;
vector<int> ans;
for(int i = 1; i < m; i++) {
int timetoreachhere = (express[i] - 1) * b;
int timeleft = maxTim - timetoreachhere;
if(timeleft < 0) {
continue;
}
curAns += min((timeleft / a) + 1, express[i + 1] - express[i]);
if((timeleft / a) + 1 >= express[i + 1] - express[i]) {
curAns--;
continue;
}
//cout << "curAns = " << curAns << "\n";
int starting = express[i] + timeleft / a + 1;
while(starting < express[i + 1]) {
int newtimeleft = timetoreachhere + c * (starting - express[i]);
newtimeleft = maxTim - newtimeleft;
if(newtimeleft < 0) {
break;
}
int ending = min(starting + newtimeleft / a, express[i + 1]);
if(ending == express[i + 1]) {
//cout << "Pushing: " << ending - starting << "\n";
ans.push_back(ending - starting);
}
else {
//cout << "Pushing: " << ending - starting + 1 << "\n";
ans.push_back(ending - starting + 1);
}
//cout << "i = " << i << "\n";
//cout << "starting = " << starting << ", ending = " << ending << "\n";
//cout << "time to reach here = " << timetoreachhere << ", newtimeleft = " << newtimeleft << "\n";
if(starting == ending) {
break;
}
starting = ending;
}
}
curAns--;
if(b * (express[m] - 1) <= maxTim) {
curAns++;
}
sort(ans.begin(), ans.end());
reverse(ans.begin(), ans.end());
for(int i = 0; i < k - m; i++) {
curAns += ans[i];
}
cout << curAns << "\n";
}
int32_t main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int t = 1;
//cin >> t;
while(t--) {
Solve();
}
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Runtime error |
1 ms |
460 KB |
Execution killed with signal 11 |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Runtime error |
1 ms |
460 KB |
Execution killed with signal 11 |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Runtime error |
1 ms |
460 KB |
Execution killed with signal 11 |
| 2 |
Halted |
0 ms |
0 KB |
- |
