제출 #1089484

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1089484		vjudge1	Growing Vegetable is Fun 3 (JOI19_ho_t3)	C++17	15 / 100	6 ms	2368 KiB

joi2019_ho_t3

/**
 *    data : 09.07.2024  
 *     
**/
#include <bits/stdc++.h>
// #include "algo/turnikmen.h"

using namespace std;


#define int long long
#define bitt __builtin_popcountll
#define bitzero __builtin_clz

#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
// #pragma GCC optimize("-funsafe-loop-optimizations") 
#pragma GCC optimize("-funroll-loops") 
// #pragma GCC optimize("-fwhole-program") 
#pragma GCC optimize("Ofast,no-stack-protector") 
#pragma GCC optimize("-fthread-jumps") 
#pragma GCC optimize("-falign-functions") 
#pragma GCC optimize("-falign-jumps") 
#pragma GCC optimize("-falign-loops") 
#pragma GCC optimize("-falign-labels") 
#pragma GCC optimize("-fcaller-saves") 
#pragma GCC optimize("-fcrossjumping") 
#pragma GCC optimize("-fcse-follow-jumps") 
// #pragma GCC optimize("-fcse-skip-blocks") 
#pragma GCC optimize("-fdelete-null-pointer-checks") 
#pragma GCC optimize("-fdevirtualize") 
#pragma GCC optimize("-fexpensive-optimizations") 
#pragma GCC optimize("-fgcse") 
#pragma GCC optimize("-fgcse-lm") 
#pragma GCC optimize("-fhoist-adjacent-loads") 
#pragma GCC optimize("-finline-small-functions") 
#pragma GCC optimize("-findirect-inlining") 
#pragma GCC optimize("-fipa-sra") 
#pragma GCC optimize("-foptimize-sibling-calls") 
#pragma GCC optimize("-fpartial-inlining") 
#pragma GCC optimize("-fpeephole2") 
#pragma GCC optimize("-freorder-blocks") 
#pragma GCC optimize("-freorder-functions") 
#pragma GCC optimize("-frerun-cse-after-loop") 
#pragma GCC optimize("-fsched-interblock") 
#pragma GCC optimize("-fsched-spec") 
#pragma GCC optimize("-fschedule-insns") 
#pragma GCC optimize("-fschedule-insns2") 
#pragma GCC optimize("-fstrict-aliasing") 
// #pragma GCC optimize("-fstrict-overflow") 
#pragma GCC optimize("-ftree-switch-conversion") 
#pragma GCC optimize("-ftree-tail-merge") 
#pragma GCC optimize("-ftree-pre") 
#pragma GCC optimize("-ftree-vrp") 
#pragma GCC target("avx")

// void fReopen () {
//         #ifndef ONLINE_JUDGE
//         freopen("input.txt", "r", stdin);
//         freopen("output.txt", "w", stdout);
//         #endif
// }



signed main (/*  time : 9:17 AM   */) {
        ios_base::sync_with_stdio(false);
        cin.tie(nullptr);
        cout.tie(nullptr);
 
        // fReopen();
       
        int n; cin >> n;
        string s; cin >> s; s = '1' + s;
        vector<int> g[4];
        int pref[4][n + 2];
        int R = 0, G = 1, Y = 2;
        int cntr, cntg, cnty;
        cntr = cntg = cnty = 0;
        pref[0][0] = pref[1][0] = pref[2][0] = 0;
        for (int i = 1; i <= n; i++) {
                for (int j = 0; j < 3; j++) pref[j][i] += pref[j][i - 1];
                if (s[i] == 'R') {
                        cntr++;
                        g[0].push_back(i);
                        pref[0][i]++;
                }else if(s[i] == 'G') {
                        cntg++;
                        g[2].push_back(i);
                        pref[2][i]++;
                }else if(s[i] == 'Y') {
                        cnty++;
                        g[1].push_back(i);
                        pref[1][i]++;
                }

        }
        int dp[n + 1][cntr + 1][cnty + 1][3] = { };

         for (int i = 1; i <= n; i++) {
                for (int a = 0; a <= cntr; a++) {
                        for (int b = 0; b <= cnty; b++) {
                                for (int j = 0; j < 3; j++)
                                dp[i][a][b][j] = 1e18;

                        }
                }
        }
        for (int i = 0; i < 3; i++) dp[0][0][0][i] = 0;

        for (int i = 1; i <= n; i++) {
                for (int a = 0; a <= cntr; a++) {
                        for (int b = 0; b <= cnty; b++) {
                                if (a + b > i) continue;
                                int c = i - a - b;
                                if (c > cntg) continue; 
                                for (int last = 0; last < 3; last++) {
                                        if (last != 0 && a) {
                                                int j = g[0][a - 1];
                                                int adj = max(0ll, b - pref[1][j]) + max(0ll, c - pref[2][j]);
                                                int val = max(0ll, j + adj - i);
                                                dp[i][a][b][0] = min(dp[i][a][b][0], dp[i - 1][a - 1][b][last] + val);
                                        }
                                        if (last != 1 && b) {
                                                int j = g[1][b - 1];
                                                int adj = max(0ll, a - pref[0][j]) + max(0ll, c - pref[2][j]);
                                                int val = max(0ll, j + adj - i);
                                                dp[i][a][b][1] = min(dp[i][a][b][1], dp[i - 1][a][b - 1][last] + val);
                                        }
                                        if (last != 2 && c) {
                                                int j = g[2][c - 1];
                                                int adj = max(0ll, a - pref[0][j]) + max(0ll, b - pref[1][j]);
                                                int val = max(0ll, j + adj - i);
                                                dp[i][a][b][2] = min(dp[i][a][b][2], dp[i - 1][a][b][last] + val);
                                        }
                                }
                                // if (a > 0) {
                                //         int pos = g[0][a - 1];
                                //         int cnt = max(0LL, b - pref[{1, pos}]) + max(0LL, c - pref[{2, pos}]);
                                //         dp[i][a][b][0] = min(dp[i][a][b][0], min(dp[i - 1][a - 1][b][1], dp[i - 1][a - 1][b][2]) + max(0LL, pos + cnt - i));
                                // }
                                // if (b > 0) {
                                //         int pos = g[1][b - 1];
                                //         int cnt = max(0LL, a - pref[{0, pos}]) + max(0LL, c - pref[{2, pos}]);
                                //         dp[i][a][b][1] = min(dp[i][a][b][1], min(dp[i - 1][a][b - 1][0], dp[i - 1][a][b - 1][2]) + max(0LL, pos + cnt - i));
                                // }
                                // if (c > 0) {
                                //         int pos = g[2][c - 1];
                                //         int cnt = max(0LL, b - pref[{1, pos}]) + max(0LL, a - pref[{0, pos}]);
                                //         dp[i][a][b][2] = min(dp[i][a][b][2], min(dp[i - 1][a][b][0], dp[i - 1][a][b][1]) + max(0LL, pos + cnt - i));
                                // }        

                        }
                }
        }
        //  for (int i = 1; i <= n; i++) {
        //         for (int a = 0; a <= cntr; a++) {
        //                 for (int b = 0; b <= cnty; b++) {
        //                         if (a + b > i) continue;
        //                         int c = i - a - b;
        //                         if (c > cntg) continue; 
        //                         cout << dp[i][]
        //                 }
        //         }
        // }
        int res = min({dp[n][cntr][cnty][0], dp[n][cntr][cnty][1], dp[n][cntr][cnty][2]});
        cout << (res == 1e18 ? -1 : res);
 
}

컴파일 시 표준 에러 (stderr) 메시지

joi2019_ho_t3.cpp: In function 'int main()':
joi2019_ho_t3.cpp:77:13: warning: unused variable 'R' [-Wunused-variable]
   77 |         int R = 0, G = 1, Y = 2;
      |             ^
joi2019_ho_t3.cpp:77:20: warning: unused variable 'G' [-Wunused-variable]
   77 |         int R = 0, G = 1, Y = 2;
      |                    ^
joi2019_ho_t3.cpp:77:27: warning: unused variable 'Y' [-Wunused-variable]
   77 |         int R = 0, G = 1, Y = 2;
      |                           ^

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