제출 #365034

#제출 시각아이디문제언어결과실행 시간메모리
365034nafis_shifatSemiexpress (JOI17_semiexpress)C++14
0 / 100
1 ms384 KiB
#include<bits/stdc++.h> #define ll long long #define pii pair<int,int> using namespace std; const int mxn=1e5+5; const int inf=1e9; priority_queue<ll> pq; ll a,b,c; ll n,m,k; ll t; ll res = 0; void prc(ll l,ll r) { ll cost = (l - 1) * b; if(cost > t) return; ll td = (t - cost)/a; ll i = min(r,l + td + 1); res += i - l; int cnt = 0; while(cnt <= k - m && i < r) { ll lc = cost + (i - l) * c; if(lc > t) return; ll x = (t - lc) / a; ll to = min(r,i + x + 1); pq.push(to - i); i = to; cnt++; } } int main() { cin >> n >> m >> k; cin >> a >> b >> c; cin>>t; ll exp[m + 1]; for(int i = 1; i <= m; i++) cin >> exp[i]; for(int i = 2; i <= m; i++) prc(exp[i - 1],exp[i]); for(int i = 1; i <= k - m && !pq.empty(); i++) { res += pq.top(); pq.pop(); } if(b * exp[m] <= t) res++; cout<<res - 1<<endl; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...