oj.uz

Submission #876430

# Submission time Handle Problem Language Result Execution time Memory
876430 2023-11-21T18:12:44 Z ArashJafariyan Semiexpress (JOI17_semiexpress) C++17
100 / 100
 373 ms 55512 KB 
#include <bits/stdc++.h>
using namespace std;

#define ll long long 
#define pb push_back

const int M = 3e3 + 4;

int n, m, k, a, b, c, s[M];
ll t, mx[M][M], dp[M][M];

int main() {
    ios::sync_with_stdio(0);
    cin.tie(0);

    cin >> n >> m >> k;
    cin >> a >> b >> c;
    cin >> t;
    for (int i = 0; i < m; ++i) {
        cin >> s[i];
        --s[i];
    }
    k -= m; // k: number of semi-express stations we need to add
    s[m] = n;

    // mx[i][j]: maximum distance to travel from station s[i] if we use exactly j semi-express station
    // dp[i][j]: maximum answer if we use i stations from s and j semi-express station

    for (int i = 0; i < m; ++i) {
        ll preCost = 1ll * s[i] * b; 
        if (preCost > t)
            break;

        mx[i][0] = (t - preCost) / a;
        mx[i][0] = min(mx[i][0], 0ll + s[i + 1] - s[i] - 1);
        for (int j = 1; j <= k; ++j) {
            if (mx[i][j - 1] == s[i + 1] - s[i] - 1) {
                mx[i][j] = mx[i][j - 1];
                break;
            }
            
            preCost = 1ll * s[i] * b + 1ll * c * (mx[i][j - 1] + 1);
            if (preCost > t) {
                mx[i][j] = mx[i][j - 1];
                break;
            }
            ll canTravel = (t - preCost) / a;

            mx[i][j] = mx[i][j - 1] + 1 + canTravel;
            mx[i][j] = min(mx[i][j], 0ll + s[i + 1] - s[i] - 1);
        }

        if (i == 0) 
            for (int j = 0; j <= k; ++j)
                dp[i][j] = mx[i][j];
        else 
            for (int j = 0; j <= k; ++j) 
                for (int l = 0; l <= j; ++l)
                    dp[i][j] = max(dp[i][j], dp[i - 1][j - l] + mx[i][l] + 1);
    }

    ll ans = 0;
    for (int i = 0; i < m; ++i)
        for (int j = 0; j <= k; ++j)
            ans = max(ans, dp[i][j]);
    cout << ans;

    return 0;
}

Subtask #1
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Correct 1 ms 2392 KB Output is correct
3 Correct 1 ms 4700 KB Output is correct
4 Correct 1 ms 2396 KB Output is correct
5 Correct 1 ms 2396 KB Output is correct
6 Correct 1 ms 2396 KB Output is correct
7 Correct 1 ms 2396 KB Output is correct
8 Correct 1 ms 2392 KB Output is correct

Subtask #2
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Correct 1 ms 2392 KB Output is correct
3 Correct 1 ms 4700 KB Output is correct
4 Correct 1 ms 2396 KB Output is correct
5 Correct 1 ms 2396 KB Output is correct
6 Correct 1 ms 2396 KB Output is correct
7 Correct 1 ms 2396 KB Output is correct
8 Correct 1 ms 2392 KB Output is correct
9 Correct 1 ms 2396 KB Output is correct
10 Correct 1 ms 2396 KB Output is correct
11 Correct 1 ms 2396 KB Output is correct
12 Correct 0 ms 2512 KB Output is correct
13 Correct 1 ms 2396 KB Output is correct
14 Correct 1 ms 2508 KB Output is correct
15 Correct 1 ms 2396 KB Output is correct
16 Correct 1 ms 2512 KB Output is correct
17 Correct 0 ms 2392 KB Output is correct
18 Correct 1 ms 2396 KB Output is correct

Subtask #3
52.0 / 52.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Correct 1 ms 2392 KB Output is correct
3 Correct 1 ms 4700 KB Output is correct
4 Correct 1 ms 2396 KB Output is correct
5 Correct 1 ms 2396 KB Output is correct
6 Correct 1 ms 2396 KB Output is correct
7 Correct 1 ms 2396 KB Output is correct
8 Correct 1 ms 2392 KB Output is correct
9 Correct 1 ms 2396 KB Output is correct
10 Correct 1 ms 2396 KB Output is correct
11 Correct 1 ms 2396 KB Output is correct
12 Correct 0 ms 2512 KB Output is correct
13 Correct 1 ms 2396 KB Output is correct
14 Correct 1 ms 2508 KB Output is correct
15 Correct 1 ms 2396 KB Output is correct
16 Correct 1 ms 2512 KB Output is correct
17 Correct 0 ms 2392 KB Output is correct
18 Correct 1 ms 2396 KB Output is correct
19 Correct 29 ms 8796 KB Output is correct
20 Correct 125 ms 5560 KB Output is correct
21 Correct 1 ms 4952 KB Output is correct
22 Correct 3 ms 7516 KB Output is correct
23 Correct 373 ms 54900 KB Output is correct
24 Correct 6 ms 36188 KB Output is correct
25 Correct 1 ms 2396 KB Output is correct
26 Correct 9 ms 55512 KB Output is correct
27 Correct 7 ms 43360 KB Output is correct
28 Correct 7 ms 43360 KB Output is correct
29 Correct 102 ms 18920 KB Output is correct
30 Correct 194 ms 6184 KB Output is correct