# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
854604 | AaW | Semiexpress (JOI17_semiexpress) | C++14 | 0 ms | 348 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>
using namespace std;
#define ll long long
#define pii pair<int,int>
#define AI(x) begin(x),end(x)
#define endl '\n'
#ifdef DEBUG
#define debug(args...) LKJ("\033[1;32m[ "+string(#args)+" ]\033[0m", args)
template<class I> void LKJ(I&&x){ cerr << x << '\n'; }
template<class I, class...T> void LKJ(I&&x, T&&...t){ cerr << x << ", ", LKJ(t...); }
template<class I> void OI(I a, I b){ while(a < b) cerr << *a << " \n"[next(a) == b], ++a; }
#else
#define debug(...) 0
#define OI(...) 0
#endif
#define _ ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
signed main() {_
ll n, m, k;
cin >> n >> m >> k;
ll a, b, c;
cin >> a >> b >> c;
vector<bool> fast(n+5);
ll t; cin >> t;
for (int i = 0; i < m; ++i) {
int s; cin >> s;
fast[s] = 1;
}
priority_queue<int> pq;
int cnt = 0;
int lb = 1;
for (int i = 1; i < n; ++i) {
if (fast[i+1]) lb = i;
if (i * a <= t || lb*b + (i-lb)*a <= t){
cnt++;
debug("RRR", i);
continue;
}
ll cc = 0;
for (int j = i; j <= n; ++j) {
if (fast[j+1]) break;
debug(i, j, lb, lb*b, (i-lb)*c, (j-i)*a);
if (lb*b + (i-lb)*c + (j-i)*a > t) break;
cc++;
}
pq.push(cc);
}
for (int i = 0; i < k - m; ++i) {
if (pq.empty()) break;
cnt += pq.top();
pq.pop();
}
cout << cnt << endl;
}
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... |