oj.uz

Submission #1039532

# Submission time Handle Problem Language Result Execution time Memory
1039532 2024-07-31T03:36:01 Z underwaterkillerwhale Visiting Singapore (NOI20_visitingsingapore) C++17
10 / 100
 1656 ms 214616 KB 
#include <bits/stdc++.h>
#define se              second
#define fs              first
#define mp              make_pair
#define pb              push_back
#define ll              long long
#define ii              pair<ll,ll>
#define ld              long double
#define SZ(v)           (int)v.size()
#define ALL(v)          v.begin(), v.end()
#define bit(msk, i)     ((msk >> i) & 1)
#define iter(id, v)     for(auto id : v)
#define rep(i,m,n)      for(int i=(m); i<=(n); i++)
#define reb(i,m,n)      for(int i=(m); i>=(n); i--)
using namespace std;

mt19937_64 rd(chrono :: steady_clock :: now().time_since_epoch().count());
ll Rand(ll l, ll r) { return uniform_int_distribution<ll> (l, r)(rd); }

const int N = 5e3 + 7;
const int Mod = 1e9 + 7;
const int szBL = 240;
const ll INF = 1e18;
const int BASE = 137;

int n, K, m;
ll A, B;
ll dp[N][N];
int V[N];
int T[N], S[N];
int lst[N][N];

inline void maximize (ll &A, ll B) { if (A < B) A = B; }

void solution () {
    cin >> K >> n >> m >> A >> B;
    rep (i, 1, K) cin >> V[i];
    rep (i, 1, n) cin >> S[i];
    rep (i, 1, m) cin >> T[i];
    rep (i, 1, K)
    rep (j, 1, n) {
        lst[i][j] = (S[j] == i) ? j : lst[i][j - 1];
    }
    rep (i, 0, m)
    rep (j, 0, n) dp[i][j] = -INF;
    dp[0][0] = 0;
    rep (j, 1, n) {
        rep (i, 1, m) {
            if (S[j] == T[i]) {
                if (i == 1) maximize(dp[i][j], V[T[1]]);
                else maximize (dp[i][j], A + B * (i - 1) + V[T[i]]);

                rep (k, 1, i - 1) {
                    int t = lst[T[k]][j - 1];
                    dp[i][j] = max(dp[i][j], dp[k][t] + A * (i - k >= 2) + B * (i - k - 1) + A * (j - t >= 2) + B * (j - t - 1) + V[T[i]]);
                }
//                cout << i <<" "<<j<<" "<<dp[i][j] <<"\n";
            }
        }
    }
    ll res = -INF;
    rep (i, 1, m)
    rep (j, 1, n) res = max(res, dp[i][j] + A * (i != m) + B * (m - i));
    cout << res <<"\n";
}
#define file(name) freopen(name".inp", "r", stdin); \
freopen(name".out", "w", stdout);
/*
*/
int main () {
//    file("c");
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    ll num_Test = 1;
//    cin >> num_Test;
    while(num_Test--)
        solution();
}
/*
no bug challenge +2
*/

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2652 KB Output is correct
2 Correct 1150 ms 10588 KB Output is correct
3 Correct 3 ms 860 KB Output is correct
4 Correct 0 ms 604 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 128 ms 3416 KB Output is correct
7 Correct 2 ms 856 KB Output is correct
8 Correct 20 ms 3420 KB Output is correct
9 Correct 466 ms 8540 KB Output is correct
10 Correct 1507 ms 14232 KB Output is correct

Subtask #2
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 9564 KB Output is correct
2 Correct 3 ms 7516 KB Output is correct
3 Correct 288 ms 10804 KB Output is correct
4 Correct 5 ms 6744 KB Output is correct
5 Correct 55 ms 2652 KB Output is correct
6 Correct 558 ms 7256 KB Output is correct
7 Correct 651 ms 7768 KB Output is correct
8 Correct 865 ms 14172 KB Output is correct
9 Correct 41 ms 7768 KB Output is correct
10 Correct 1523 ms 17096 KB Output is correct

Subtask #3
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 30 ms 30040 KB Output is correct
2 Correct 16 ms 21336 KB Output is correct
3 Correct 462 ms 77180 KB Output is correct
4 Correct 729 ms 187260 KB Output is correct
5 Correct 1656 ms 66652 KB Output is correct
6 Correct 484 ms 86612 KB Output is correct
7 Correct 468 ms 143192 KB Output is correct
8 Correct 62 ms 65612 KB Output is correct
9 Correct 225 ms 109656 KB Output is correct
10 Correct 1600 ms 203416 KB Output is correct
11 Correct 1260 ms 205652 KB Output is correct
12 Correct 907 ms 212004 KB Output is correct
13 Incorrect 115 ms 214616 KB Output isn't correct
14 Halted 0 ms 0 KB -

Subtask #4
0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 30 ms 30040 KB Output is correct
2 Correct 16 ms 21336 KB Output is correct
3 Correct 462 ms 77180 KB Output is correct
4 Correct 729 ms 187260 KB Output is correct
5 Correct 1656 ms 66652 KB Output is correct
6 Correct 484 ms 86612 KB Output is correct
7 Correct 468 ms 143192 KB Output is correct
8 Correct 62 ms 65612 KB Output is correct
9 Correct 225 ms 109656 KB Output is correct
10 Correct 1600 ms 203416 KB Output is correct
11 Correct 1260 ms 205652 KB Output is correct
12 Correct 907 ms 212004 KB Output is correct
13 Incorrect 115 ms 214616 KB Output isn't correct
14 Halted 0 ms 0 KB -

Subtask #5
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 30 ms 30040 KB Output is correct
2 Correct 16 ms 21336 KB Output is correct
3 Correct 462 ms 77180 KB Output is correct
4 Correct 729 ms 187260 KB Output is correct
5 Correct 1656 ms 66652 KB Output is correct
6 Correct 484 ms 86612 KB Output is correct
7 Correct 468 ms 143192 KB Output is correct
8 Correct 62 ms 65612 KB Output is correct
9 Correct 225 ms 109656 KB Output is correct
10 Correct 1600 ms 203416 KB Output is correct
11 Correct 1260 ms 205652 KB Output is correct
12 Correct 907 ms 212004 KB Output is correct
13 Incorrect 115 ms 214616 KB Output isn't correct
14 Halted 0 ms 0 KB -

Subtask #6
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4700 KB Output is correct
2 Correct 1 ms 4444 KB Output is correct
3 Correct 1 ms 4700 KB Output is correct
4 Correct 1 ms 2908 KB Output is correct
5 Correct 1 ms 2908 KB Output is correct
6 Correct 1 ms 860 KB Output is correct
7 Correct 1 ms 856 KB Output is correct
8 Correct 0 ms 604 KB Output is correct
9 Correct 1 ms 1116 KB Output is correct
10 Correct 1 ms 860 KB Output is correct
11 Correct 1 ms 1372 KB Output is correct
12 Correct 1 ms 3164 KB Output is correct
13 Incorrect 1 ms 1112 KB Output isn't correct
14 Halted 0 ms 0 KB -

Subtask #7
0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2652 KB Output is correct
2 Correct 1150 ms 10588 KB Output is correct
3 Correct 3 ms 860 KB Output is correct
4 Correct 0 ms 604 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 128 ms 3416 KB Output is correct
7 Correct 2 ms 856 KB Output is correct
8 Correct 20 ms 3420 KB Output is correct
9 Correct 466 ms 8540 KB Output is correct
10 Correct 1507 ms 14232 KB Output is correct
11 Correct 16 ms 9564 KB Output is correct
12 Correct 3 ms 7516 KB Output is correct
13 Correct 288 ms 10804 KB Output is correct
14 Correct 5 ms 6744 KB Output is correct
15 Correct 55 ms 2652 KB Output is correct
16 Correct 558 ms 7256 KB Output is correct
17 Correct 651 ms 7768 KB Output is correct
18 Correct 865 ms 14172 KB Output is correct
19 Correct 41 ms 7768 KB Output is correct
20 Correct 1523 ms 17096 KB Output is correct
21 Correct 30 ms 30040 KB Output is correct
22 Correct 16 ms 21336 KB Output is correct
23 Correct 462 ms 77180 KB Output is correct
24 Correct 729 ms 187260 KB Output is correct
25 Correct 1656 ms 66652 KB Output is correct
26 Correct 484 ms 86612 KB Output is correct
27 Correct 468 ms 143192 KB Output is correct
28 Correct 62 ms 65612 KB Output is correct
29 Correct 225 ms 109656 KB Output is correct
30 Correct 1600 ms 203416 KB Output is correct
31 Correct 1260 ms 205652 KB Output is correct
32 Correct 907 ms 212004 KB Output is correct
33 Incorrect 115 ms 214616 KB Output isn't correct
34 Halted 0 ms 0 KB -