oj.uz

Submission #878951

# Submission time Handle Problem Language Result Execution time Memory
878951 2023-11-25T17:30:17 Z frostray8653 Growing Vegetable is Fun 3 (JOI19_ho_t3) C++17
100 / 100
 84 ms 3044 KB 
#include <bits/stdc++.h>
#define int long long
#define IO ios::sync_with_stdio(0), cin.tie(0)
#define FOR(i, a, b) for (int i = a, I = b; i <= I; i++)
using namespace std;
using pii = pair<int, int>;
void dbg() {;}
template<class T, class ...U>
void dbg(T a, U ...b) { cout << a << " "; dbg(b...); }
void ent() { cout << "\n"; }
const int INF = 1e16;
const int N = 405;
int r[N], g[N], y[N];

signed main() {
    IO;

    int n;
    cin >> n;
    string s;
    cin >> s;
    vector<int> rid, gid, yid;
    rid.push_back(0);
    gid.push_back(0);
    yid.push_back(0);
    FOR(i, 0, n - 1) {
        if (s[i] == 'R')
            r[i] = 1;
        else if (s[i] == 'G')
            g[i] = 1;
        else
            y[i] = 1;
        if (s[i] == 'R')
            rid.push_back(i);
        else if (s[i] == 'G')
            gid.push_back(i);
        else
            yid.push_back(i);
        if (i) {
            r[i] += r[i - 1];
            g[i] += g[i - 1];
            y[i] += y[i - 1];
        }
    }
    int numr = rid.size() - 1, numg = gid.size() - 1, numy = yid.size() - 1;
    // FOR(i, 0, n - 1) dbg(r[i]); ent();
    // FOR(i, 0, n - 1) dbg(g[i]); ent();
    // FOR(i, 0, n - 1) dbg(y[i]); ent();

    vector<vector<int>> dpr(numr + 1, vector<int>(numg + 1, INF));
    vector<vector<int>> dpg(numr + 1, vector<int>(numg + 1, INF));
    vector<vector<int>> dpy(numr + 1, vector<int>(numg + 1, INF));
    dpr[0][0] = dpg[0][0] = dpy[0][0] = 0;

    for (int tot = 1; tot <= n; tot++) {
        vector<vector<int>> ndpr(numr + 1, vector<int>(numg + 1, INF));
        vector<vector<int>> ndpg(numr + 1, vector<int>(numg + 1, INF));
        vector<vector<int>> ndpy(numr + 1, vector<int>(numg + 1, INF));
        for (int i = 0; i <= numr; i++) {
            for (int j = 0; i + j <= tot && j <= numg; j++) {
                int k = tot - i - j;
                if (k > numy) continue;
                if (i)
                    ndpr[i][j] = min(
                        dpg[i - 1][j] + max(0ll, g[gid[j]] - g[rid[i]]) + max(0ll, y[yid[k]] - y[rid[i]]),
                        dpy[i - 1][j] + max(0ll, g[gid[j]] - g[rid[i]]) + max(0ll, y[yid[k]] - y[rid[i]])
                    );
                if (j)
                    ndpg[i][j] = min(
                        dpr[i][j - 1] + max(0ll, r[rid[i]] - r[gid[j]]) + max(0ll, y[yid[k]] - y[gid[j]]),
                        dpy[i][j - 1] + max(0ll, r[rid[i]] - r[gid[j]]) + max(0ll, y[yid[k]] - y[gid[j]])
                    );
                if (k)
                    ndpy[i][j] = min(
                        dpr[i][j] + max(0ll, r[rid[i]] - r[yid[k]]) + max(0ll, g[gid[j]] - g[yid[k]]),
                        dpg[i][j] + max(0ll, r[rid[i]] - r[yid[k]]) + max(0ll, g[gid[j]] - g[yid[k]])
                    );
            }
        }
        swap(dpr, ndpr);
        swap(dpg, ndpg);
        swap(dpy, ndpy);
    }

    int ans = min({dpr[numr][numg], dpg[numr][numg], dpy[numr][numg]});
    if (ans >= INF)
        cout << -1 << "\n";
    else
        cout << ans << "\n";

    return 0;
}

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 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 344 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 1 ms 344 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 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 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 344 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 1 ms 344 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 1 ms 344 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 1 ms 348 KB Output is correct
28 Correct 1 ms 348 KB Output is correct
29 Correct 1 ms 348 KB Output is correct
30 Correct 1 ms 348 KB Output is correct
31 Correct 1 ms 344 KB Output is correct
32 Correct 1 ms 348 KB Output is correct
33 Correct 1 ms 348 KB Output is correct
34 Correct 1 ms 348 KB Output is correct
35 Correct 1 ms 348 KB Output is correct
36 Correct 1 ms 348 KB Output is correct
37 Correct 0 ms 348 KB Output is correct
38 Correct 1 ms 348 KB Output is correct
39 Correct 1 ms 348 KB Output is correct
40 Correct 0 ms 348 KB Output is correct
41 Correct 0 ms 348 KB Output is correct

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 72 ms 2408 KB Output is correct
3 Correct 72 ms 2408 KB Output is correct
4 Correct 73 ms 2404 KB Output is correct
5 Correct 73 ms 2404 KB Output is correct
6 Correct 84 ms 2408 KB Output is correct
7 Correct 71 ms 2648 KB Output is correct
8 Correct 71 ms 2628 KB Output is correct
9 Correct 72 ms 2400 KB Output is correct
10 Correct 78 ms 3044 KB Output is correct
11 Correct 84 ms 2408 KB Output is correct
12 Correct 5 ms 1012 KB Output is correct
13 Correct 24 ms 1400 KB Output is correct
14 Correct 43 ms 1808 KB Output is correct
15 Correct 81 ms 2420 KB Output is correct
16 Correct 79 ms 2652 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 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 344 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 1 ms 344 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 1 ms 344 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 1 ms 348 KB Output is correct
28 Correct 1 ms 348 KB Output is correct
29 Correct 1 ms 348 KB Output is correct
30 Correct 1 ms 348 KB Output is correct
31 Correct 1 ms 344 KB Output is correct
32 Correct 1 ms 348 KB Output is correct
33 Correct 1 ms 348 KB Output is correct
34 Correct 1 ms 348 KB Output is correct
35 Correct 1 ms 348 KB Output is correct
36 Correct 1 ms 348 KB Output is correct
37 Correct 0 ms 348 KB Output is correct
38 Correct 1 ms 348 KB Output is correct
39 Correct 1 ms 348 KB Output is correct
40 Correct 0 ms 348 KB Output is correct
41 Correct 0 ms 348 KB Output is correct
42 Correct 1 ms 364 KB Output is correct
43 Correct 72 ms 2408 KB Output is correct
44 Correct 72 ms 2408 KB Output is correct
45 Correct 73 ms 2404 KB Output is correct
46 Correct 73 ms 2404 KB Output is correct
47 Correct 84 ms 2408 KB Output is correct
48 Correct 71 ms 2648 KB Output is correct
49 Correct 71 ms 2628 KB Output is correct
50 Correct 72 ms 2400 KB Output is correct
51 Correct 78 ms 3044 KB Output is correct
52 Correct 84 ms 2408 KB Output is correct
53 Correct 5 ms 1012 KB Output is correct
54 Correct 24 ms 1400 KB Output is correct
55 Correct 43 ms 1808 KB Output is correct
56 Correct 81 ms 2420 KB Output is correct
57 Correct 79 ms 2652 KB Output is correct
58 Correct 35 ms 1116 KB Output is correct
59 Correct 58 ms 1448 KB Output is correct
60 Correct 36 ms 1368 KB Output is correct
61 Correct 53 ms 1340 KB Output is correct
62 Correct 73 ms 2684 KB Output is correct
63 Correct 74 ms 2340 KB Output is correct
64 Correct 82 ms 2108 KB Output is correct
65 Correct 68 ms 1888 KB Output is correct
66 Correct 54 ms 1340 KB Output is correct
67 Correct 51 ms 1308 KB Output is correct
68 Correct 56 ms 1304 KB Output is correct
69 Correct 53 ms 1344 KB Output is correct
70 Correct 55 ms 1412 KB Output is correct
71 Correct 34 ms 1332 KB Output is correct
72 Correct 20 ms 952 KB Output is correct
73 Correct 2 ms 348 KB Output is correct