Submission #1295829

#	Time	Username	Problem	Language	Result	Execution time	Memory
1295829		fairkrash	Growing Vegetable is Fun 3 (JOI19_ho_t3)	C++20	75 / 100	541 ms	136908 KiB

joi2019_ho_t3

#include <bits/stdc++.h>

using namespace std;
using ll = int;
ll INF = 1e9;
ll MOD = 1e9 + 7;


int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);
    ll n;
    cin >> n;
    string s;
    cin >> s;
    ll v1 = 0, v2 = 0, v3 = 0;
    vector<ll> d1, d2, d3;
    for (ll i = 0; i < s.size(); i++) {
        if (s[i] == 'R') {
            v1++;
            d1.push_back(i);
        }
        if (s[i] == 'G') {
            v2++;
            d2.push_back(i);
        }
        if (s[i] == 'Y') {
            v3++;
            d3.push_back(i);
        }
    }
    ll mx = max({v1, v2, v3});
    if (mx > n - mx + 1) {
        cout << -1;
        return 0;
    }
    vector<vector<vector<vector<ll>>>> dp(v1 + 2,
                                          vector<vector<vector<ll>>>(v2 + 2,
                                                                     vector<vector<ll>>(v3 + 2, vector<ll>(3, INF))));
    dp[1][0][0][0] = 0;
    dp[0][1][0][1] = 0;
    dp[0][0][1][2] = 0;
    for (ll a = 0; a <= v1; a++) {
        for (ll b = 0; b <= v2; b++) {
            for (ll c = 0; c <= v3; c++) {
                if (a + b + c == 0)continue;
                for (ll e = 0; e < 3; e++) {
                    for (ll j = 0; j < 3; j++) {
                        if (j == e) continue;
                        if (j == 0) {
                            if (a == v1)continue;
                            ll k = d1[a];
                            ll h1 = max((ll)(a - (upper_bound(d1.begin(), d1.end(), k) - d1.begin())), 0);
                            ll h2 = max((ll)(b - (upper_bound(d2.begin(), d2.end(), k) - d2.begin())), 0);
                            ll h3 = max((ll)(c - (upper_bound(d3.begin(), d3.end(), k) - d3.begin())), 0);
                            dp[a + 1][b][c][j] = min(dp[a + 1][b][c][j], dp[a][b][c][e] + h1 + h2 + h3);
                        }
                        if (j == 1) {
                            if (b == v2)continue;
                            ll k = d2[b];
                            ll h1 = max((ll)(a - (upper_bound(d1.begin(), d1.end(), k) - d1.begin())), 0);
                            ll h2 = max((ll)(b - (upper_bound(d2.begin(), d2.end(), k) - d2.begin())), 0);
                            ll h3 = max((ll)(c - (upper_bound(d3.begin(), d3.end(), k) - d3.begin())), 0);
                            dp[a][b + 1][c][j] = min(dp[a][b + 1][c][j], dp[a][b][c][e] + h1 + h2 + h3);
                        }
                        if (j == 2) {
                            if (c == v3)continue;
                            ll k = d3[c];
                            ll h1 = max((ll)(a - (upper_bound(d1.begin(), d1.end(), k) - d1.begin())), 0);
                            ll h2 = max((ll)(b - (upper_bound(d2.begin(), d2.end(), k) - d2.begin())), 0);
                            ll h3 = max((ll)(c - (upper_bound(d3.begin(), d3.end(), k) - d3.begin())), 0);
                            dp[a][b][c + 1][j] = min(dp[a][b][c + 1][j], dp[a][b][c][e] + h1 + h2 + h3);
                        }
                    }
                }
            }
        }
    }
    cout << min({dp[v1][v2][v3][0], dp[v1][v2][v3][1], dp[v1][v2][v3][2]});
}

• Subtask 1: 5 / 5
• Subtask 2: 55 / 55
• Subtask 3: 15 / 15
• Subtask 4: 0 / 25