Submission #1165300

#	Time	Username	Problem	Language	Result	Execution time	Memory
1165300		MPG	Growing Vegetable is Fun 3 (JOI19_ho_t3)	C++20	100 / 100	73 ms	164932 KiB

joi2019_ho_t3

//#pragma GCC optomize("Ofast")
//#pragma GCC optimize("unroll-loops")
//#pragma GCC optimize("O3")
//#pragma GCC target("avx2")
//#pragma GCC target("sse,sse2,sse4.1,sse4.2") 



#include <bits/stdc++.h>
using namespace std;
typedef long long       ll;
#define     max_heap priority_queue<pair <ll, pair <ll, ll>>>
#define     min_heap priority_queue<pair <ll, ll>, vector<pair <ll, ll>>, greater<pair <ll, ll>>>
#define     sariE cin.tie(NULL); cout.tie(NULL); ios_base::sync_with_stdio(false);
#define     filE freopen("in.txt", "r", stdin);// freopen("out1.txt", "w", stdout); 
#define     endl '\n'
#define     md(a) (a % mod + mod) % mod
#define     pb push_back
//mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
//cout << setprecision(5) << fixed << f;
//hash prime = 769


ll const maxn = 2e5 + 123;
ll const inf = 3e18;
ll const loG = 18; // 23
ll const mod = 1e9 + 7;
//ll const mod = 998244353;
ll const sq = 500;
ll power(ll a, ll b, ll mod){if(b==0)return 1;if(b==1)return a;ll x = power(a, b / 2, mod);return (((x * x) % mod) * (b % 2 ? a : 1)) % mod;}


ll n, before[405][3], dp[405][405][405][3], ans, sz0, sz1, sz2;
string s;
vector <ll> pos[3];


void Solve(){

cin >> n >> s;
for (int i = 0; i < n; i++){
    if (s[i] == 'R')
        pos[0].push_back (i + 1);
    if (s[i] == 'G')
        pos[1].push_back (i + 1);
    if (s[i] == 'Y')
        pos[2].push_back (i + 1);
    before[i + 1][0] = pos[0].size();
    before[i + 1][1] = pos[1].size();
    before[i + 1][2] = pos[2].size();
}
sz0 = pos[0].size();
sz1 = pos[1].size();
sz2 = pos[2].size();
for (int i = 0; i <= sz0; i++){
    for (int j = 0; j <= sz1; j++){
        for (int k = 0; k <= sz2; k++){
            if (!i && !j && !k)
                continue;
            for (int l = 0; l <= 2; l++)
                dp[i][j][k][l] = inf;

            ll kol = i + j + k;
            if (i)
                dp[i][j][k][0] = min(dp[i - 1][j][k][1], dp[i - 1][j][k][2]) + (pos[0][i - 1] + max(j - before[pos[0][i - 1]][1], (ll)0) + max(k - before[pos[0][i - 1]][2], (ll)0)) - kol;
            if (j)
                dp[i][j][k][1] = min(dp[i][j - 1][k][0], dp[i][j - 1][k][2]) + (pos[1][j - 1] + max(i - before[pos[1][j - 1]][0], (ll)0) + max(k - before[pos[1][j - 1]][2], (ll)0)) - kol;
            if (k)
                dp[i][j][k][2] = min(dp[i][j][k - 1][0], dp[i][j][k - 1][1]) + (pos[2][k - 1] + max(i - before[pos[2][k - 1]][0], (ll)0) + max(j - before[pos[2][k - 1]][1], (ll)0)) - kol;
            // cout << i << ' ' << j << ' ' << k << ' ' << dp[i][j][k][0] << ' ' << dp[i][j][k][1] << ' ' << dp[i][j][k][2] << endl;
        }
    }
}
ans = inf;
for (int i = 0; i < 3; i++)
    ans = min(ans, dp[sz0][sz1][sz2][i]);
if (ans == inf)
    cout << -1 << endl;
else
    cout << ans << endl;



}





int main(){
sariE;
//filE;



int test = 1;
//cin >> test;
while (test--) Solve();
return 0;
}

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