oj.uz

Submission #962461

# Submission time Handle Problem Language Result Execution time Memory
962461 2024-04-13T15:21:16 Z peterandvoi Growing Vegetable is Fun 3 (JOI19_ho_t3) C++17
100 / 100
 180 ms 135504 KB 
#include <bits/stdc++.h>

using namespace std;

#ifdef ngu
#include "debug.h"
#else
#define debug(...) 42
#endif

const int N = 405, INF = (int) 1e9;

int n;
char s[N];
int a[N], sz[N];
int cost[3][N][N];
vector<int> pos[3];

template<class A, class B>
bool mini(A &a, const B &b) {
    return a > b ? a = b, true : false;
}

signed main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    #ifdef ngu
    freopen("test.inp", "r", stdin);
    freopen("test.out", "w", stdout);
    #endif
    cin >> n;
    for (int i = 1; i <= n; ++i) {
        cin >> s[i];
        a[i] = (s[i] == 'Y' ? 2 : (s[i] == 'G'));
        pos[a[i]].emplace_back(i);
        sz[a[i]]++;
    }
    for (int c = 0; c < 3; ++c) {
        for (int i = 0; i <= sz[c]; ++i) {
            for (int j = 1; j <= n; ++j) {
                for (int k = i; k < sz[c]; ++k) {
                    cost[c][i][j] += j > pos[c][k];
                }
            }
        }
    }
    vector<vector<vector<vector<int>>>> dp(sz[0] + 1, vector<vector<vector<int>>>(sz[1] + 1, vector<vector<int>>(sz[2] + 1, vector<int>(3, INF))));
    for (int c = 0; c < 3; ++c) {
        dp[0][0][0][c] = 0;
    }
    for (int i = 0; i <= sz[0]; ++i) {
        for (int j = 0; j <= sz[1]; ++j) {
            for (int k = 0; k <= sz[2]; ++k) {
                for (int c = 0; c < 3; ++c) {
                    if (dp[i][j][k][c] != INF) {
                        auto calc = [&](int idx) {
                            return cost[0][i][idx] + cost[1][j][idx] + cost[2][k][idx];
                        };
                        if (c != 0 && i + 1 <= sz[0]) {
                            mini(dp[i + 1][j][k][0], dp[i][j][k][c] + calc(pos[0][i]));
                        }
                        if (c != 1 && j + 1 <= sz[1]) {
                            mini(dp[i][j + 1][k][1], dp[i][j][k][c] + calc(pos[1][j]));
                        }
                        if (c != 2 && k + 1 <= sz[2]) {
                            mini(dp[i][j][k + 1][2], dp[i][j][k][c] + calc(pos[2][k]));
                        }
                    }
                }
            }
        }
    }
    int res = INF;
    for (int c = 0; c < 3; ++c) {
        res = min(res, dp[sz[0]][sz[1]][sz[2]][c]);
    }
    cout << (res == INF ? -1 : res);
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 432 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 1 ms 344 KB Output is correct
16 Correct 1 ms 344 KB Output is correct
17 Correct 1 ms 356 KB Output is correct

Subtask #2
55.0 / 55.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 432 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 1 ms 344 KB Output is correct
16 Correct 1 ms 344 KB Output is correct
17 Correct 1 ms 356 KB Output is correct
18 Correct 1 ms 856 KB Output is correct
19 Correct 1 ms 856 KB Output is correct
20 Correct 1 ms 860 KB Output is correct
21 Correct 1 ms 860 KB Output is correct
22 Correct 1 ms 980 KB Output is correct
23 Correct 2 ms 860 KB Output is correct
24 Correct 1 ms 1028 KB Output is correct
25 Correct 1 ms 600 KB Output is correct
26 Correct 1 ms 600 KB Output is correct
27 Correct 1 ms 860 KB Output is correct
28 Correct 1 ms 1116 KB Output is correct
29 Correct 1 ms 1116 KB Output is correct
30 Correct 1 ms 860 KB Output is correct
31 Correct 1 ms 860 KB Output is correct
32 Correct 1 ms 860 KB Output is correct
33 Correct 1 ms 600 KB Output is correct
34 Correct 1 ms 604 KB Output is correct
35 Correct 1 ms 860 KB Output is correct
36 Correct 1 ms 860 KB Output is correct
37 Correct 2 ms 860 KB Output is correct
38 Correct 1 ms 860 KB Output is correct
39 Correct 1 ms 1116 KB Output is correct
40 Correct 0 ms 604 KB Output is correct
41 Correct 1 ms 604 KB Output is correct

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 16 ms 4444 KB Output is correct
3 Correct 18 ms 4512 KB Output is correct
4 Correct 20 ms 4444 KB Output is correct
5 Correct 17 ms 4444 KB Output is correct
6 Correct 16 ms 4568 KB Output is correct
7 Correct 16 ms 4504 KB Output is correct
8 Correct 15 ms 4440 KB Output is correct
9 Correct 16 ms 4444 KB Output is correct
10 Correct 16 ms 4468 KB Output is correct
11 Correct 16 ms 4444 KB Output is correct
12 Correct 3 ms 1624 KB Output is correct
13 Correct 6 ms 2392 KB Output is correct
14 Correct 10 ms 3164 KB Output is correct
15 Correct 18 ms 4440 KB Output is correct
16 Correct 16 ms 4644 KB Output is correct

Subtask #4
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 432 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 1 ms 344 KB Output is correct
16 Correct 1 ms 344 KB Output is correct
17 Correct 1 ms 356 KB Output is correct
18 Correct 1 ms 856 KB Output is correct
19 Correct 1 ms 856 KB Output is correct
20 Correct 1 ms 860 KB Output is correct
21 Correct 1 ms 860 KB Output is correct
22 Correct 1 ms 980 KB Output is correct
23 Correct 2 ms 860 KB Output is correct
24 Correct 1 ms 1028 KB Output is correct
25 Correct 1 ms 600 KB Output is correct
26 Correct 1 ms 600 KB Output is correct
27 Correct 1 ms 860 KB Output is correct
28 Correct 1 ms 1116 KB Output is correct
29 Correct 1 ms 1116 KB Output is correct
30 Correct 1 ms 860 KB Output is correct
31 Correct 1 ms 860 KB Output is correct
32 Correct 1 ms 860 KB Output is correct
33 Correct 1 ms 600 KB Output is correct
34 Correct 1 ms 604 KB Output is correct
35 Correct 1 ms 860 KB Output is correct
36 Correct 1 ms 860 KB Output is correct
37 Correct 2 ms 860 KB Output is correct
38 Correct 1 ms 860 KB Output is correct
39 Correct 1 ms 1116 KB Output is correct
40 Correct 0 ms 604 KB Output is correct
41 Correct 1 ms 604 KB Output is correct
42 Correct 0 ms 344 KB Output is correct
43 Correct 16 ms 4444 KB Output is correct
44 Correct 18 ms 4512 KB Output is correct
45 Correct 20 ms 4444 KB Output is correct
46 Correct 17 ms 4444 KB Output is correct
47 Correct 16 ms 4568 KB Output is correct
48 Correct 16 ms 4504 KB Output is correct
49 Correct 15 ms 4440 KB Output is correct
50 Correct 16 ms 4444 KB Output is correct
51 Correct 16 ms 4468 KB Output is correct
52 Correct 16 ms 4444 KB Output is correct
53 Correct 3 ms 1624 KB Output is correct
54 Correct 6 ms 2392 KB Output is correct
55 Correct 10 ms 3164 KB Output is correct
56 Correct 18 ms 4440 KB Output is correct
57 Correct 16 ms 4644 KB Output is correct
58 Correct 162 ms 133912 KB Output is correct
59 Correct 175 ms 134188 KB Output is correct
60 Correct 164 ms 133096 KB Output is correct
61 Correct 159 ms 134596 KB Output is correct
62 Correct 24 ms 13068 KB Output is correct
63 Correct 33 ms 21344 KB Output is correct
64 Correct 91 ms 67408 KB Output is correct
65 Correct 129 ms 96340 KB Output is correct
66 Correct 154 ms 132564 KB Output is correct
67 Correct 157 ms 132368 KB Output is correct
68 Correct 158 ms 134384 KB Output is correct
69 Correct 180 ms 135504 KB Output is correct
70 Correct 159 ms 134844 KB Output is correct
71 Correct 166 ms 131668 KB Output is correct
72 Correct 54 ms 34904 KB Output is correct
73 Correct 24 ms 11176 KB Output is correct