#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;
}
//cout << "timeleft = " << timeleft << "\n";
curAns += min((timeleft / a) + 1, express[i + 1] - express[i]);
//cout << "curAns = " << curAns << "\n";
if((timeleft / a) + 1 >= express[i + 1] - express[i]) {
//cout << "curAns = " << curAns << "\n";
continue;
}
int starting = express[i] + timeleft / a + 1;
int cnt = 0;
while(starting < express[i + 1] && cnt <= k - m) {
cnt++;
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";
starting = ending + 1;
}
}
curAns--;
if(b * (express[m] - 1) <= maxTim) {
curAns++;
}
if(ans.size() != 0) {
sort(ans.begin(), ans.end());
reverse(ans.begin(), ans.end());
int x = ans.size();
for(int i = 0; i < min(x, k - m); i++) {
curAns += ans[i];
}
}
cout << curAns << "\n";
}
int32_t main() {
auto begin = std::chrono::high_resolution_clock::now();
ios_base::sync_with_stdio(0);
cin.tie(0);
int t = 1;
//cin >> t;
while(t--) {
Solve();
}
auto end = std::chrono::high_resolution_clock::now();
auto elapsed = std::chrono::duration_cast<std::chrono::nanoseconds>(end - begin);
cerr << "Time measured: " << elapsed.count() * 1e-9 << " seconds.\n";
}
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
1 ms |
204 KB |
Output is correct |
| 2 |
Correct |
1 ms |
204 KB |
Output is correct |
| 3 |
Correct |
1 ms |
204 KB |
Output is correct |
| 4 |
Correct |
1 ms |
204 KB |
Output is correct |
| 5 |
Correct |
0 ms |
204 KB |
Output is correct |
| 6 |
Correct |
0 ms |
204 KB |
Output is correct |
| 7 |
Correct |
1 ms |
204 KB |
Output is correct |
| 8 |
Correct |
1 ms |
204 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
1 ms |
204 KB |
Output is correct |
| 2 |
Correct |
1 ms |
204 KB |
Output is correct |
| 3 |
Correct |
1 ms |
204 KB |
Output is correct |
| 4 |
Correct |
1 ms |
204 KB |
Output is correct |
| 5 |
Correct |
0 ms |
204 KB |
Output is correct |
| 6 |
Correct |
0 ms |
204 KB |
Output is correct |
| 7 |
Correct |
1 ms |
204 KB |
Output is correct |
| 8 |
Correct |
1 ms |
204 KB |
Output is correct |
| 9 |
Correct |
1 ms |
204 KB |
Output is correct |
| 10 |
Correct |
1 ms |
204 KB |
Output is correct |
| 11 |
Correct |
0 ms |
204 KB |
Output is correct |
| 12 |
Correct |
0 ms |
204 KB |
Output is correct |
| 13 |
Correct |
0 ms |
204 KB |
Output is correct |
| 14 |
Correct |
0 ms |
204 KB |
Output is correct |
| 15 |
Correct |
1 ms |
204 KB |
Output is correct |
| 16 |
Correct |
0 ms |
204 KB |
Output is correct |
| 17 |
Correct |
0 ms |
204 KB |
Output is correct |
| 18 |
Correct |
1 ms |
204 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
1 ms |
204 KB |
Output is correct |
| 2 |
Correct |
1 ms |
204 KB |
Output is correct |
| 3 |
Correct |
1 ms |
204 KB |
Output is correct |
| 4 |
Correct |
1 ms |
204 KB |
Output is correct |
| 5 |
Correct |
0 ms |
204 KB |
Output is correct |
| 6 |
Correct |
0 ms |
204 KB |
Output is correct |
| 7 |
Correct |
1 ms |
204 KB |
Output is correct |
| 8 |
Correct |
1 ms |
204 KB |
Output is correct |
| 9 |
Correct |
1 ms |
204 KB |
Output is correct |
| 10 |
Correct |
1 ms |
204 KB |
Output is correct |
| 11 |
Correct |
0 ms |
204 KB |
Output is correct |
| 12 |
Correct |
0 ms |
204 KB |
Output is correct |
| 13 |
Correct |
0 ms |
204 KB |
Output is correct |
| 14 |
Correct |
0 ms |
204 KB |
Output is correct |
| 15 |
Correct |
1 ms |
204 KB |
Output is correct |
| 16 |
Correct |
0 ms |
204 KB |
Output is correct |
| 17 |
Correct |
0 ms |
204 KB |
Output is correct |
| 18 |
Correct |
1 ms |
204 KB |
Output is correct |
| 19 |
Correct |
1 ms |
204 KB |
Output is correct |
| 20 |
Correct |
1 ms |
204 KB |
Output is correct |
| 21 |
Correct |
1 ms |
204 KB |
Output is correct |
| 22 |
Correct |
2 ms |
460 KB |
Output is correct |
| 23 |
Correct |
17 ms |
4536 KB |
Output is correct |
| 24 |
Correct |
1 ms |
332 KB |
Output is correct |
| 25 |
Correct |
1 ms |
204 KB |
Output is correct |
| 26 |
Correct |
1 ms |
332 KB |
Output is correct |
| 27 |
Correct |
1 ms |
332 KB |
Output is correct |
| 28 |
Correct |
1 ms |
332 KB |
Output is correct |
| 29 |
Correct |
11 ms |
4548 KB |
Output is correct |
| 30 |
Correct |
7 ms |
2504 KB |
Output is correct |
