# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
81259 | farukkastamonuda | Semiexpress (JOI17_semiexpress) | C++14 | 3 ms | 876 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
#define fi first
#define se second
#define lo long long
#define inf 1000000000
#define md 1000000007
#define li 300005
#define mp make_pair
#define pb push_back
#define pi pair<lo int, int>
using namespace std;
int n, m, k, s[li], mx;
lo int a, b, c, t, rem[li], ans;
priority_queue< pair<lo int, int> > q;
lo int calc(int ind){
lo int tut = (t - (s[ind] - 1) * b - (s[ind + 1] - s[ind] - 1 - rem[ind]) * c);
if(tut < c) return 0;
return min(rem[ind], (tut - c) / a + 1);
}
int main(){
scanf("%d %d %d %lld %lld %lld %lld", &n, &m, &k, &a, &b, &c, &t);
for(int i = 1; i <= m ; i ++){
scanf("%d", &s[i]);
}
for(int i = 1; i < m ; i ++){
if((s[i] - s[1]) * b > t) break;
mx = i;
}
for(int i = 1; i <= mx ; i ++){
rem[i] = max(0ll, (s[i + 1] - s[i] - 1) - (t - (s[i] - 1) * b) / a);
q.push(mp(calc(i), i));
}
k -= m;
while(k --){
int temp = q.top().fi;
int ind = q.top().se;
q.pop();
rem[ind] -= temp;
q.push(mp(calc(ind), ind));
}
for(int i = 1; i <= mx; i ++){
ans += s[i + 1] - s[i] - rem[i];
}
if((s[m] - 1) * b <= t) ans ++;
printf("%lld\n", ans - 1);
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |