oj.uz

Submission #843807

# Submission time Handle Problem Language Result Execution time Memory
843807 2023-09-04T15:15:05 Z fanwen Visiting Singapore (NOI20_visitingsingapore) C++17
30 / 100
 337 ms 1292 KB 
#include <bits/stdc++.h>

using namespace std;

#define MASK(x) (1LL << (x))
#define BIT(x, i) (((x) >> (i)) & 1)
#define ALL(x) (x).begin(), (x).end()
#define REP(i, n) for (int i = 0, _n = n; i < _n; ++i)
#define FOR(i, a, b) for (int i = (a), _b = (b); i <= _b; ++i)
#define FORD(i, a, b) for (int i = (a), _b = (b); i >= _b; --i)
#define FORE(i, a, b) for (int i = (a), _b = (b); i < _b; ++i)
#define debug(...) "[" << #__VA_ARGS__ ": " << (__VA_ARGS__) << "] "
#define file(name) if (fopen(name".inp", "r")) { freopen(name".inp", "r", stdin); freopen(name".out", "w", stdout); }

template <class A, class B> bool minimize(A &a, B b)  { if (a > b) { a = b; return true; } return false; }
template <class A, class B> bool maximize(A &a, B b)  { if (a < b) { a = b; return true; } return false; }
template <class T> T max(const T &a, const T &b, const T &c) { return max(max(a, b), c); }
template <class T> T min(const T &a, const T &b, const T &c) { return min(min(a, b), c); }

#define int long long

const int MAXN = 5e3 + 5;

int N, M, K, A, B;
int v[MAXN / 5], s[MAXN], t[MAXN];
int dp[MAXN], Max[MAXN], Max_j[MAXN];

void you_make_it(void) {
    cin >> K >> N >> M >> A >> B;
    FOR(i, 1, K) cin >> v[i];
    FOR(i, 1, N) cin >> s[i];
    FOR(i, 1, M) cin >> t[i];
    memset(dp, -0x3f, sizeof dp);
    memset(Max, -0x3f, sizeof Max);
    memset(Max_j, -0x3f, sizeof Max_j);
    long long ans = M * B + A;
    FOR(i, 1, N) {
        vector <int> pre_dp(dp, dp + M + 1), pre_Max(Max, Max + M + 1), pre_Max_j(Max_j, Max_j + M + 1);
        memset(dp, -0x3f, sizeof dp);
        memset(Max, -0x3f, sizeof Max);
        memset(Max_j, -0x3f, sizeof Max_j);
        vector <int> Max_i(M + 1, -1e18);
        FOR(j, 1, M) {
            maximize(dp[j], max(pre_Max[j - 1] + (i + j) * B + 2 * A, Max_i[j - 1] + (i + j) * B + A, pre_Max_j[j] + (i + j) * B + A));
            if(s[i] == t[j]) {
                maximize(dp[j], v[s[i]] + A * (j != 1) + (j - 1) * B);
                maximize(dp[j], pre_dp[j - 1] + v[s[i]]);
                maximize(ans, dp[j] + A * (j != M) + (M - j) * B);
            }
            Max[j] = max(pre_Max[j], Max[j - 1], pre_dp[j] - (i + j) * B);
            Max_i[j] = max(dp[j] - (i + j) * B, Max_i[j - 1]);
            Max_j[j] = max(dp[j] - (i + j) * B, pre_Max_j[j]);
        }
    }
    cout << ans;
}

signed main() {

#ifdef LOCAL
    freopen("TASK.inp", "r", stdin);
    freopen("TASK.out", "w", stdout);
#endif
    auto start_time = chrono::steady_clock::now();

    cin.tie(0), cout.tie(0) -> sync_with_stdio(0);

    you_make_it();

    auto end_time = chrono::steady_clock::now();

    cerr << "\nExecution time : " << chrono::duration_cast <chrono::milliseconds> (end_time - start_time).count() << "[ms]" << endl;

    return (0 ^ 0);
}

// Dream it. Wish it. Do it.

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 8 ms 600 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 2 ms 344 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 3 ms 600 KB Output is correct
7 Correct 1 ms 544 KB Output is correct
8 Correct 2 ms 344 KB Output is correct
9 Correct 5 ms 600 KB Output is correct
10 Correct 10 ms 604 KB Output is correct

Subtask #2
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 600 KB Output is correct
2 Correct 0 ms 600 KB Output is correct
3 Correct 3 ms 600 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 1 ms 600 KB Output is correct
6 Correct 5 ms 600 KB Output is correct
7 Correct 5 ms 600 KB Output is correct
8 Correct 7 ms 600 KB Output is correct
9 Correct 1 ms 600 KB Output is correct
10 Correct 10 ms 600 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 21 ms 600 KB Output is correct
2 Correct 11 ms 600 KB Output is correct
3 Correct 65 ms 600 KB Output is correct
4 Correct 225 ms 844 KB Output is correct
5 Correct 44 ms 604 KB Output is correct
6 Correct 63 ms 600 KB Output is correct
7 Correct 118 ms 800 KB Output is correct
8 Correct 41 ms 652 KB Output is correct
9 Correct 75 ms 724 KB Output is correct
10 Correct 286 ms 860 KB Output is correct
11 Correct 282 ms 860 KB Output is correct
12 Correct 274 ms 964 KB Output is correct
13 Correct 279 ms 812 KB Output is correct
14 Correct 337 ms 1196 KB Output is correct
15 Correct 322 ms 808 KB Output is correct

Subtask #4
0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 21 ms 600 KB Output is correct
2 Correct 11 ms 600 KB Output is correct
3 Correct 65 ms 600 KB Output is correct
4 Correct 225 ms 844 KB Output is correct
5 Correct 44 ms 604 KB Output is correct
6 Correct 63 ms 600 KB Output is correct
7 Correct 118 ms 800 KB Output is correct
8 Correct 41 ms 652 KB Output is correct
9 Correct 75 ms 724 KB Output is correct
10 Correct 286 ms 860 KB Output is correct
11 Correct 282 ms 860 KB Output is correct
12 Correct 274 ms 964 KB Output is correct
13 Correct 279 ms 812 KB Output is correct
14 Correct 337 ms 1196 KB Output is correct
15 Correct 322 ms 808 KB Output is correct
16 Incorrect 98 ms 736 KB Output isn't correct
17 Halted 0 ms 0 KB -

Subtask #5
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 21 ms 600 KB Output is correct
2 Correct 11 ms 600 KB Output is correct
3 Correct 65 ms 600 KB Output is correct
4 Correct 225 ms 844 KB Output is correct
5 Correct 44 ms 604 KB Output is correct
6 Correct 63 ms 600 KB Output is correct
7 Correct 118 ms 800 KB Output is correct
8 Correct 41 ms 652 KB Output is correct
9 Correct 75 ms 724 KB Output is correct
10 Correct 286 ms 860 KB Output is correct
11 Correct 282 ms 860 KB Output is correct
12 Correct 274 ms 964 KB Output is correct
13 Correct 279 ms 812 KB Output is correct
14 Correct 337 ms 1196 KB Output is correct
15 Correct 322 ms 808 KB Output is correct
16 Correct 223 ms 1172 KB Output is correct
17 Correct 75 ms 856 KB Output is correct
18 Correct 23 ms 600 KB Output is correct
19 Correct 7 ms 600 KB Output is correct
20 Correct 3 ms 600 KB Output is correct
21 Correct 5 ms 600 KB Output is correct
22 Correct 71 ms 604 KB Output is correct
23 Correct 15 ms 600 KB Output is correct
24 Correct 129 ms 740 KB Output is correct
25 Correct 283 ms 812 KB Output is correct
26 Correct 286 ms 1292 KB Output is correct
27 Correct 279 ms 808 KB Output is correct
28 Correct 292 ms 924 KB Output is correct
29 Correct 298 ms 808 KB Output is correct
30 Correct 302 ms 812 KB Output is correct

Subtask #6
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Incorrect 0 ms 344 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #7
0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 8 ms 600 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 2 ms 344 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 3 ms 600 KB Output is correct
7 Correct 1 ms 544 KB Output is correct
8 Correct 2 ms 344 KB Output is correct
9 Correct 5 ms 600 KB Output is correct
10 Correct 10 ms 604 KB Output is correct
11 Correct 1 ms 600 KB Output is correct
12 Correct 0 ms 600 KB Output is correct
13 Correct 3 ms 600 KB Output is correct
14 Correct 1 ms 344 KB Output is correct
15 Correct 1 ms 600 KB Output is correct
16 Correct 5 ms 600 KB Output is correct
17 Correct 5 ms 600 KB Output is correct
18 Correct 7 ms 600 KB Output is correct
19 Correct 1 ms 600 KB Output is correct
20 Correct 10 ms 600 KB Output is correct
21 Correct 21 ms 600 KB Output is correct
22 Correct 11 ms 600 KB Output is correct
23 Correct 65 ms 600 KB Output is correct
24 Correct 225 ms 844 KB Output is correct
25 Correct 44 ms 604 KB Output is correct
26 Correct 63 ms 600 KB Output is correct
27 Correct 118 ms 800 KB Output is correct
28 Correct 41 ms 652 KB Output is correct
29 Correct 75 ms 724 KB Output is correct
30 Correct 286 ms 860 KB Output is correct
31 Correct 282 ms 860 KB Output is correct
32 Correct 274 ms 964 KB Output is correct
33 Correct 279 ms 812 KB Output is correct
34 Correct 337 ms 1196 KB Output is correct
35 Correct 322 ms 808 KB Output is correct
36 Incorrect 98 ms 736 KB Output isn't correct
37 Halted 0 ms 0 KB -