Submission #133200

#	Time	Username	Problem	Language	Result	Execution time	Memory
133200		osaaateiasavtnl	Growing Vegetable is Fun 3 (JOI19_ho_t3)	C++14	100 / 100	48 ms	3732 KiB

joi2019_ho_t3

#include<bits/stdc++.h>
using namespace std;
const int N = 401;
const int INF = 1e9 + 7;
vector <char> al = {'R', 'G', 'Y'};
int dp1[N][N][3], dp2[N][N][3];
int cnt[3];
vector <int> pos[3];
int ar[3][N][N];
char s[N];
void mm(int &a, int b) {
    a = min(a, b);
}   
int get(char c) {
    for (int i = 0; i < 3; ++i) {
        if (al[i] == c) {
            return i;
        }   
    }   
}   
signed main() {
    #ifdef HOME
    freopen("input.txt", "r", stdin);
    #else
    ios_base::sync_with_stdio(0); cin.tie(0);
    #endif
    int n;
    cin >> n;
    for (int i = 1; i <= n; ++i) {
        cin >> s[i];
        ++cnt[get(s[i])];
        pos[get(s[i])].push_back(i);
    }   

    for (int t = 0; t < 3; ++t) {
        for (int i = 0; i < pos[t].size(); ++i) {
            for (int j = 0; j < N; ++j) {
                ar[t][i + 1][j] = ar[t][i][j] + (pos[t][i] > j);   
            }
        }   
    }   

    for (int i = 0; i < N; ++i) {
        for (int j = 0; j < N; ++j) {
            for (int t = 0; t < 3; ++t) {
                dp1[i][j][t] = INF;
            }   
        }   
    }   
    for (int i = 0; i < 3; ++i) {
        dp1[0][0][i] = 0;
    }   
    for (int i = 0; i <= cnt[0]; ++i) {
        for (int j = 0; j <= cnt[1]; ++j) {
            for (int k = 0; k <= cnt[2]; ++k) {
                for (int pr = 0; pr < 3; ++pr) {
                    dp2[j][k][pr] = INF;
                }
            }   
        }   
        for (int j = 0; j <= cnt[1]; ++j) {
            for (int k = 0; k <= cnt[2]; ++k) {
                for (int pr = 0; pr < 3; ++pr) {
                    //cout << i << ' ' << j << ' ' << k << ' ' << pr << ' ' << dp1[j][k][pr] << '\n';
                    int p = i + j + k + 1;
                    if (i < cnt[0] && pr != 0) {
                        mm(dp2[j][k][0], dp1[j][k][pr] + ar[1][j][pos[0][i]] + ar[2][k][pos[0][i]]);
                    }
                    if (j < cnt[1] && pr != 1) {
                        mm(dp1[j + 1][k][1], dp1[j][k][pr] + ar[0][i][pos[1][j]] + ar[2][k][pos[1][j]]);
                    }   
                    if (k < cnt[2] && pr != 2) {
                        mm(dp1[j][k + 1][2], dp1[j][k][pr] + ar[0][i][pos[2][k]] + ar[1][j][pos[2][k]]);
                    }   
                }
            }   
        }   
        if (i == cnt[0]) break;
        for (int j = 0; j <= cnt[1]; ++j) {
            for (int k = 0; k <= cnt[2]; ++k) {
                for (int pr = 0; pr < 3; ++pr) {
                    dp1[j][k][pr] = dp2[j][k][pr];
                }
            }   
        }   
    }   
    int ans = INF;
    for (int i = 0; i < 3; ++i) {
        ans = min(ans, dp1[cnt[1]][cnt[2]][i]);
    }   
    if (ans == INF) {
        cout << "-1\n";
    }   
    else {
        cout << ans << '\n';
    }   
}   

Compilation message (stderr)

joi2019_ho_t3.cpp: In function 'int main()':
joi2019_ho_t3.cpp:36:27: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for (int i = 0; i < pos[t].size(); ++i) {
                         ~~^~~~~~~~~~~~~~~
joi2019_ho_t3.cpp:65:25: warning: unused variable 'p' [-Wunused-variable]
                     int p = i + j + k + 1;
                         ^
joi2019_ho_t3.cpp: In function 'int get(char)':
joi2019_ho_t3.cpp:20:1: warning: control reaches end of non-void function [-Wreturn-type]
 }   
 ^

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