#include<bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
float db,y[100000],x[1000000];
long long t,i,l,n,mod=1000000007,c,a,m,e,d,b,k,j,w[300005],f,z[300005],g=0,q,p,r[300005],h,o[1001][1001];
map<ll,ll>blp;
set<ll>st;
string s,sa[200005],ta[200005],sn,sm,sk,cr,sx,sy;
pair<ll,ll>pr[30005];
char ch[200005];
vector<ll>ret,v;
cin>>n>>m>>k;
cin>>a>>b>>c;
cin>>t;
for (i=1; i<=m; i++){
cin>>z[i];
}
g=0;
h=0;
for (i=2; i<=m; i++){
d=z[i-1];
e=z[i-1]*b-b;
while (d<z[i]){
if (e>t){
break;
}
f=d+(t-e)/a;
f=min(f,z[i]-1);
if (d==z[i-1]){
g=g+f-d+1;
}
else {
v.push_back(f-d+1);
}
e=e+c*(f-d+1);
d=f+1;
h++;
if (h>=1e5){
break;
}
}
}
sort (v.begin(), v.end());
reverse (v.begin(), v.end());
for (i=0; i<min((k-m),(ll)(v.size())); i++){
g=g+v[i];
}
if((n-1)*b<=t){
g++;
}
cout<<g-1;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |