#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 = 0; i < m; i++) {
cin >> express[i];
express[i]--;
}
express[m] = n;
int curAns = 0;
vector<int> ans;
for(int i = 0; i < m; i++) {
int pos = express[i];
for(int j = 0; j <= k - m; j++) {
int timeleft = maxTim - b * express[i] - c * (pos - express[i]);
cout << "i = " << i << ", j = " << j << ", pos = " << pos << ", timeleft = " << timeleft << "\n";
if(timeleft < 0) {
break;
}
int ending = min(express[i + 1] - 1, pos + timeleft / a);
cout << "ending = " << ending << "\n";
if(ending < pos) {
break;
}
if(j == 0) {
curAns += ending - pos + 1;
}
else {
ans.push_back(ending - pos + 1);
}
pos = ending + 1;
}
}
cout << "curAns = " << curAns << "\n";
if(ans.size() != 0) {
sort(ans.begin(), ans.end());
reverse(ans.begin(), ans.end());
for(int i = 0; i < k - m; i++) {
curAns += ans[i];
}
}
cout << curAns - 1 << "\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";
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
1 ms |
204 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
1 ms |
204 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
1 ms |
204 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
