#include "bits/stdc++.h"
using namespace std;
#define ar array
#define int long long
const int N = 3005;
int p[N];
signed main(){
ios::sync_with_stdio(0); cin.tie(0);
int n, m, k; cin>>n>>m>>k;
int a, b, c; cin>>a>>b>>c;
int T; cin>>T;
for(int i=0;i<m;i++) cin>>p[i];
vector<int> cc;
int res = -1;
for(int i=0;i+1<m;i++){
int t = (p[i] - 1) * b;
if(t > T) continue;
int P = min(p[i+1], p[i] + (T - t) / a + 1);
//~ cout<<p[i]<<" "<<P - 1<<" must\n";
res += (P - p[i]);
for(int j=0;j<k && P < p[i+1];j++){
int t_ = t + (P - p[i]) * c;
if(t_ > T) break;
int P_ = min(p[i+1], P + (T - t_) / a + 1);
//~ cout<<P<<" "<<P_ - 1<<"\n";
cc.push_back(P_ - P);
P = P_;
}
} if((n - 1) * b <= T) res++;
sort(cc.rbegin(), cc.rend());
for(int j=0;j<min((int)cc.size(), k - m);j++) res += cc[j];
cout<<res<<"\n";
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
212 KB |
Output is correct |
| 2 |
Correct |
0 ms |
212 KB |
Output is correct |
| 3 |
Correct |
0 ms |
328 KB |
Output is correct |
| 4 |
Correct |
0 ms |
324 KB |
Output is correct |
| 5 |
Correct |
0 ms |
212 KB |
Output is correct |
| 6 |
Correct |
0 ms |
212 KB |
Output is correct |
| 7 |
Correct |
0 ms |
324 KB |
Output is correct |
| 8 |
Correct |
0 ms |
324 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
212 KB |
Output is correct |
| 2 |
Correct |
0 ms |
212 KB |
Output is correct |
| 3 |
Correct |
0 ms |
328 KB |
Output is correct |
| 4 |
Correct |
0 ms |
324 KB |
Output is correct |
| 5 |
Correct |
0 ms |
212 KB |
Output is correct |
| 6 |
Correct |
0 ms |
212 KB |
Output is correct |
| 7 |
Correct |
0 ms |
324 KB |
Output is correct |
| 8 |
Correct |
0 ms |
324 KB |
Output is correct |
| 9 |
Correct |
0 ms |
212 KB |
Output is correct |
| 10 |
Correct |
0 ms |
212 KB |
Output is correct |
| 11 |
Correct |
1 ms |
212 KB |
Output is correct |
| 12 |
Correct |
0 ms |
212 KB |
Output is correct |
| 13 |
Correct |
0 ms |
212 KB |
Output is correct |
| 14 |
Correct |
0 ms |
212 KB |
Output is correct |
| 15 |
Correct |
1 ms |
324 KB |
Output is correct |
| 16 |
Correct |
0 ms |
212 KB |
Output is correct |
| 17 |
Correct |
0 ms |
212 KB |
Output is correct |
| 18 |
Correct |
0 ms |
212 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
212 KB |
Output is correct |
| 2 |
Correct |
0 ms |
212 KB |
Output is correct |
| 3 |
Correct |
0 ms |
328 KB |
Output is correct |
| 4 |
Correct |
0 ms |
324 KB |
Output is correct |
| 5 |
Correct |
0 ms |
212 KB |
Output is correct |
| 6 |
Correct |
0 ms |
212 KB |
Output is correct |
| 7 |
Correct |
0 ms |
324 KB |
Output is correct |
| 8 |
Correct |
0 ms |
324 KB |
Output is correct |
| 9 |
Correct |
0 ms |
212 KB |
Output is correct |
| 10 |
Correct |
0 ms |
212 KB |
Output is correct |
| 11 |
Correct |
1 ms |
212 KB |
Output is correct |
| 12 |
Correct |
0 ms |
212 KB |
Output is correct |
| 13 |
Correct |
0 ms |
212 KB |
Output is correct |
| 14 |
Correct |
0 ms |
212 KB |
Output is correct |
| 15 |
Correct |
1 ms |
324 KB |
Output is correct |
| 16 |
Correct |
0 ms |
212 KB |
Output is correct |
| 17 |
Correct |
0 ms |
212 KB |
Output is correct |
| 18 |
Correct |
0 ms |
212 KB |
Output is correct |
| 19 |
Correct |
1 ms |
340 KB |
Output is correct |
| 20 |
Correct |
1 ms |
340 KB |
Output is correct |
| 21 |
Correct |
5 ms |
2512 KB |
Output is correct |
| 22 |
Correct |
4 ms |
1492 KB |
Output is correct |
| 23 |
Correct |
16 ms |
8652 KB |
Output is correct |
| 24 |
Correct |
19 ms |
4556 KB |
Output is correct |
| 25 |
Correct |
1 ms |
340 KB |
Output is correct |
| 26 |
Correct |
1 ms |
340 KB |
Output is correct |
| 27 |
Correct |
49 ms |
16836 KB |
Output is correct |
| 28 |
Correct |
67 ms |
33316 KB |
Output is correct |
| 29 |
Correct |
13 ms |
4556 KB |
Output is correct |
| 30 |
Correct |
7 ms |
2512 KB |
Output is correct |
