제출 #168860

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
168860		srvlt	Growing Vegetable is Fun 3 (JOI19_ho_t3)	C++14	60 / 100	7 ms	4088 KiB

joi2019_ho_t3

//#pragma GCC target ("avx2,sse2")
//#pragma GCC optimization ("Ofast")
//#pragma GCC optimization ("unroll-loops")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;

#define ordered_set tree <pair <ll, int>, null_type, less <pair <ll, int> >, rb_tree_tag, tree_order_statistics_node_update>
#define ll long long
#define ull unsigned long long
#define db double
#define pb push_back
#define pf push_front
#define ppb pop_back
#define ppf pop_front
#define fi first
#define se second
#define mp make_pair
#define up_b upper_bound
#define low_b lower_bound
#define sz(x) (int)(x).size()
#define all(x) (x).begin(), (x).end()
#define endl "\n"

#define left fsdsdfoisf
#define sum dpsdfioppsf
#define assign xcvjlkdjfio
#define trie fksdfkjkfnjuiv
#define next sidlfjsfkl
#define merge sdfksdkfsldf

//#define int long long

using namespace std;

void dout() {
    cerr << endl;
}
template <typename Head, typename... Tail>
void dout(Head H, Tail... T) {
    cerr << H << ' ';
    dout(T...);
}

//mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
typedef pair <int, int> pii;

const int N = 63, inf = 1e9;
int n, dp[N][N][N][3], R, G, Y;
vector <int> r, g, y;
string s;

void upd(int & x, int y) {
    x = min(x, y);
}

void solve(int tc) {
    // check for (int i = 0; i < n; j++)
    cin >> n >> s;
    for (int i = 1; i <= n; i++) {
        if (s[i - 1] == 'R') {
            r.pb(i);
        }   else if (s[i - 1] == 'G') {
            g.pb(i);
        }   else {
            y.pb(i);
        }
    }
    R = sz(r), G = sz(g), Y = sz(y);
    for (int i = 1; i <= n; i++) {
        for (int j = 0; j <= min(i, R); j++) {
            for (int k = 0; k <= min(i - j, G); k++) {
                int l = i - j - k;
                if (l > Y) {
                    continue;
                }
                for (int h = 0; h < 3; h++) {
                    dp[j][k][l][h] = inf;
                }
                if (j > 0) {
                    upd(dp[j][k][l][0], dp[j - 1][k][l][1]);
                    upd(dp[j][k][l][0], dp[j - 1][k][l][2]);
                    int cnt = 0;
                    for (int h = 0; h < k; h++) {
                        if (g[h] > r[j - 1]) {
                            cnt++;
                        }
                    }
                    for (int h = 0; h < l; h++) {
                        if (y[h] > r[j - 1]) {
                            cnt++;
                        }
                    }
                    dp[j][k][l][0] += abs(r[j - 1] + cnt - i);
                }
                if (k > 0) {
                    upd(dp[j][k][l][1], dp[j][k - 1][l][0]);
                    upd(dp[j][k][l][1], dp[j][k - 1][l][2]);
                    int cnt = 0;
                    for (int h = 0; h < j; h++) {
                        if (r[h] > g[k - 1]) {
                            cnt++;
                        }
                    }
                    for (int h = 0; h < l; h++) {
                        if (y[h] > g[k - 1]) {
                            cnt++;
                        }
                    }
                    dp[j][k][l][1] += abs(g[k - 1] + cnt - i);
                }
                if (l > 0) {
                    upd(dp[j][k][l][2], dp[j][k][l - 1][0]);
                    upd(dp[j][k][l][2], dp[j][k][l - 1][1]);
                    int cnt = 0;
                    for (int h = 0; h < j; h++) {
                        if (r[h] > y[l - 1]) {
                            cnt++;
                        }
                    }
                    for (int h = 0; h < k; h++) {
                        if (g[h] > y[l - 1]) {
                            cnt++;
                        }
                    }
                    dp[j][k][l][2] += abs(y[l - 1] + cnt - i);
                }
            }
        }
    }
    int res = inf;
    for (int i = 0; i < 3; i++) {
        upd(res, dp[R][G][Y][i]);
    }
    if (res == inf) {
        res = -1;
    }
    cout << res;
}

signed main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
//    freopen("input.txt", "r", stdin);
//    freopen("output.txt", "w", stdout);
    int tc = 1;
//    cin >> tc;
    for (int i = 0; i < tc; i++) {
        solve(i);
//        cleanup();
    }
}

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