oj.uz

Submission #394329

# Submission time Handle Problem Language Result Execution time Memory
394329 2021-04-26T12:07:42 Z vishesh312 Semiexpress (JOI17_semiexpress) C++17
100 / 100
 33 ms 16860 KB 
#include "bits/stdc++.h"
using namespace std;
/*
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using ordered_set = tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update>;
*/

#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
#define sz(x) (int)(x).size()

using ll = long long;
const int mod = 1e9+7;

void solve(int tc) {
    ll n, m, k, a, b, c, t;
    cin >> n >> m >> k;
    cin >> a >> b >> c;
    cin >> t;
    vector<ll> v(m);
    for (auto &x : v) cin >> x;
    ll ans = ((n-1) * b <= t);
    priority_queue<int> pq;
    for (int i = 0; i < m-1; ++i) {
        ll tm = (v[i] - 1) * b;
        if (tm > t) break;
        ll cur = (t - tm) / a;
        ll mxr = min(v[i+1]-1, v[i] + cur);
        ans += mxr - v[i] + 1;
        if (!i) --ans;
        for (int j = 0; j < k and mxr < v[i+1]-1; ++j) {
            ll tm2 = tm + (mxr + 1 - v[i]) * c;
            if (tm2 > t) break;
            ll cur2 = (t - tm2) / a;
            ll mxr2 = min(v[i+1]-1, mxr+1+cur2);
            pq.push(mxr2-mxr);
            mxr = mxr2;
        }
    }
    for (int i = 0; i < k-m and !pq.empty(); ++i) {
        ans += pq.top();
        pq.pop();
    }
    cout << ans << '\n';
}

signed main() {
    cin.tie(0)->sync_with_stdio(0);
    int tc = 1;
    //cin >> tc;
    for (int i = 1; i <= tc; ++i) solve(i);
    return 0;
}

Subtask #1
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 316 KB Output is correct
5 Correct 1 ms 312 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct

Subtask #2
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 316 KB Output is correct
5 Correct 1 ms 312 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 1 ms 320 KB Output is correct
17 Correct 1 ms 320 KB Output is correct
18 Correct 1 ms 316 KB Output is correct

Subtask #3
52.0 / 52.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 316 KB Output is correct
5 Correct 1 ms 312 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 1 ms 320 KB Output is correct
17 Correct 1 ms 320 KB Output is correct
18 Correct 1 ms 316 KB Output is correct
19 Correct 1 ms 332 KB Output is correct
20 Correct 1 ms 332 KB Output is correct
21 Correct 3 ms 1480 KB Output is correct
22 Correct 2 ms 976 KB Output is correct
23 Correct 10 ms 4532 KB Output is correct
24 Correct 7 ms 2500 KB Output is correct
25 Correct 1 ms 332 KB Output is correct
26 Correct 1 ms 332 KB Output is correct
27 Correct 25 ms 8656 KB Output is correct
28 Correct 33 ms 16860 KB Output is correct
29 Correct 8 ms 2444 KB Output is correct
30 Correct 3 ms 1484 KB Output is correct