#842190 (C++17) No.291 黒い文字列

• 問題: No.291 黒い文字列
• ユーザー: snrnsidy
• 提出日時: 2023-02-21 12:59:53
• 言語: C++17 (gcc 12.3.0 + boost 1.83.0)
• 結果: AC
• 実行時間: 73 ms / 2,000 ms
• コード長: 9,170 bytes
• コンパイル時間: 3,344 ms
• コンパイル使用メモリ: 366,920 KB
• 実行使用メモリ: 5,376 KB
• 最終ジャッジ日時: 2024-07-22 00:51:15
• 合計ジャッジ時間: 5,345 ms
• ジャッジサーバーID （参考情報）: judge3 / judge2

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	3 ms; 5,248 KB
testcase_01	AC	3 ms; 5,376 KB
testcase_02	AC	3 ms; 5,376 KB
testcase_03	AC	3 ms; 5,376 KB
testcase_04	AC	3 ms; 5,376 KB
testcase_05	AC	3 ms; 5,376 KB
testcase_06	AC	3 ms; 5,376 KB
testcase_07	AC	3 ms; 5,376 KB
testcase_08	AC	3 ms; 5,376 KB
testcase_09	AC	3 ms; 5,376 KB
testcase_10	AC	3 ms; 5,376 KB
testcase_11	AC	3 ms; 5,376 KB
testcase_12	AC	3 ms; 5,376 KB
testcase_13	AC	3 ms; 5,376 KB
testcase_14	AC	3 ms; 5,376 KB
testcase_15	AC	3 ms; 5,376 KB
testcase_16	AC	58 ms; 5,376 KB
testcase_17	AC	58 ms; 5,376 KB
testcase_18	AC	56 ms; 5,376 KB
testcase_19	AC	60 ms; 5,376 KB
testcase_20	AC	64 ms; 5,376 KB
testcase_21	AC	53 ms; 5,376 KB
testcase_22	AC	61 ms; 5,376 KB
testcase_23	AC	73 ms; 5,376 KB
testcase_24	AC	58 ms; 5,376 KB
testcase_25	AC	56 ms; 5,376 KB
testcase_26	AC	56 ms; 5,376 KB
testcase_27	AC	56 ms; 5,376 KB
testcase_28	AC	56 ms; 5,376 KB
testcase_29	AC	55 ms; 5,376 KB

ソースコード

#pragma GCC optimize("O3")
#pragma GCC optimize(2)
#pragma GCC optimize(3)
#pragma GCC optimize("Ofast")
#pragma GCC optimize("inline")
#pragma GCC optimize("-fgcse")
#pragma GCC optimize("-fgcse-lm")
#pragma GCC optimize("-fipa-sra")
#pragma GCC optimize("-ftree-pre")
#pragma GCC optimize("-ftree-vrp")
#pragma GCC optimize("-fpeephole2")
#pragma GCC optimize("-ffast-math")
#pragma GCC optimize("-fsched-spec")
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("-falign-jumps")
#pragma GCC optimize("-falign-loops")	
#pragma GCC optimize("-falign-labels")
#pragma GCC optimize("-fdevirtualize")
#pragma GCC optimize("-fcaller-saves")
#pragma GCC optimize("-fcrossjumping") 
#pragma GCC optimize("-fthread-jumps")
#pragma GCC optimize("-funroll-loops")
#pragma GCC optimize("-freorder-blocks")
#pragma GCC optimize("-fschedule-insns")
#pragma GCC optimize("inline-functions")
#pragma GCC optimize("-ftree-tail-merge")
#pragma GCC optimize("-fschedule-insns2")
#pragma GCC optimize("-fstrict-aliasing")
#pragma GCC optimize("-falign-functions")
#pragma GCC optimize("-fcse-follow-jumps")
#pragma GCC optimize("-fsched-interblock")
#pragma GCC optimize("-fpartial-inlining")
#pragma GCC optimize("no-stack-protector")
#pragma GCC optimize("-freorder-functions")
#pragma GCC optimize("-findirect-inlining")
#pragma GCC optimize("-fhoist-adjacent-loads")
#pragma GCC optimize("-frerun-cse-after-loop")
#pragma GCC optimize("inline-small-functions")
#pragma GCC optimize("-finline-small-functions")
#pragma GCC optimize("-ftree-switch-conversion")
#pragma GCC optimize("-foptimize-sibling-calls")
#pragma GCC optimize("-fexpensive-optimizations")
#pragma GCC optimize("inline-functions-called-once")
#pragma GCC optimize("-fdelete-null-pointer-checks")
#pragma GCC optimize("Ofast")
//#pragma GCC target("avx,avx2,fma") 
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native") 
//#pragma GCC optimization ("unroll-loops")

#include <bits/stdc++.h>
 
using namespace std;

int dp[2][21][21][21][21];
string s;

// KUROI

int main(void)
{
	cin.tie(0);
	ios::sync_with_stdio(false);

    cin >> s;

    memset(dp,-1,sizeof(dp));

    int n = s.length();

    int m = n/5;
    dp[1][0][0][0][0] = 0;
    for(int i=0;i<n;i++)
    {
        for(int a=0;a<=m;a++)
        {
            for(int b=0;b<=m;b++)
            {
                for(int c=0;c<=m;c++)
                {
                    for(int d=0;d<=m;d++)
                    {
                        dp[0][a][b][c][d] = dp[1][a][b][c][d];
                        dp[1][a][b][c][d] = -1;
                    }
                }
            }
        }

        for(int a=0;a<=m;a++)
        {
            for(int b=0;b<=m;b++)
            {
                for(int c=0;c<=m;c++)
                {
                    for(int d=0;d<=m;d++)
                    {
                        if(dp[0][a][b][c][d]==-1) continue;
                        if(s[i]=='K')
                        {
                            if(a+1 <= m)
                            {
                                dp[1][a+1][b][c][d] = max(dp[1][a+1][b][c][d],dp[0][a][b][c][d]);
                            }
                            else
                            {
                                dp[1][m][b][c][d] = max(dp[1][m][b][c][d],dp[0][a][b][c][d]);
                            }
                        }
                        else if(s[i]=='U')
                        {
                            if(a-1>=0)
                            {
                                if(b+1<=m)
                                {
                                    dp[1][a-1][b+1][c][d] = max(dp[1][a-1][b+1][c][d],dp[0][a][b][c][d]);
                                }
                                else
                                {
                                    dp[1][a-1][m][c][d] = max(dp[1][a-1][m][c][d],dp[0][a][b][c][d]);
                                }
                            }
                            else
                            {
                                dp[1][a][b][c][d] = max(dp[1][a][b][c][d],dp[0][a][b][c][d]);
                            }
                        }
                        else if(s[i]=='R')
                        {
                            if(b-1>=0)
                            {
                                if(c+1<=m) dp[1][a][b-1][c+1][d] = max(dp[1][a][b-1][c+1][d],dp[0][a][b][c][d]);
                                else dp[1][a][b-1][m][d] = max(dp[1][a][b-1][m][d],dp[0][a][b][c][d]);
                            }
                            else
                            {
                                dp[1][a][b][c][d] = max(dp[1][a][b][c][d],dp[0][a][b][c][d]);
                            }
                        }
                        else if(s[i]=='O')
                        {
                            if(c-1>=0)
                            {
                                if(d+1<=m) dp[1][a][b][c-1][d+1] = max(dp[1][a][b][c-1][d+1],dp[0][a][b][c][d]);
                                else dp[1][a][b][c-1][m] = max(dp[1][a][b][c-1][m],dp[0][a][b][c][d]);
                            }                           
                            else
                            {
                                dp[1][a][b][c][d] = max(dp[1][a][b][c][d],dp[0][a][b][c][d]);
                            }
                        }
                        else if(s[i]=='I')
                        {
                            if(d-1>=0)
                            {
                                dp[1][a][b][c][d-1] = max(dp[1][a][b][c][d-1],dp[0][a][b][c][d] + 1);
                            }
                            else
                            {
                                dp[1][a][b][c][d] = max(dp[1][a][b][c][d],dp[0][a][b][c][d]);
                            }
                        }
                        else if(s[i]=='?')
                        {
                            if(a+1 <= m)
                            {
                                dp[1][a+1][b][c][d] = max(dp[1][a+1][b][c][d],dp[0][a][b][c][d]);
                            }
                            else
                            {
                                dp[1][m][b][c][d] = max(dp[1][m][b][c][d],dp[0][a][b][c][d]);
                            }                          
                            if(a-1>=0)
                            {
                                if(b+1<=m)
                                {
                                    dp[1][a-1][b+1][c][d] = max(dp[1][a-1][b+1][c][d],dp[0][a][b][c][d]);
                                }
                                else
                                {
                                    dp[1][a-1][m][c][d] = max(dp[1][a-1][m][c][d],dp[0][a][b][c][d]);
                                }
                            }
                            else
                            {
                                dp[1][a][b][c][d] = max(dp[1][a][b][c][d],dp[0][a][b][c][d]);
                            }
                            if(b-1>=0)
                            {
                                if(c+1<=m) dp[1][a][b-1][c+1][d] = max(dp[1][a][b-1][c+1][d],dp[0][a][b][c][d]);
                                else dp[1][a][b-1][m][d] = max(dp[1][a][b-1][m][d],dp[0][a][b][c][d]);
                            }
                            else
                            {
                                dp[1][a][b][c][d] = max(dp[1][a][b][c][d],dp[0][a][b][c][d]);
                            }
                            if(c-1>=0)
                            {
                                if(d+1<=m) dp[1][a][b][c-1][d+1] = max(dp[1][a][b][c-1][d+1],dp[0][a][b][c][d]);
                                else dp[1][a][b][c-1][m] = max(dp[1][a][b][c-1][m],dp[0][a][b][c][d]);
                            }          
                            else
                            {
                                dp[1][a][b][c][d] = max(dp[1][a][b][c][d],dp[0][a][b][c][d]);
                            }
                            if(d-1>=0)
                            {
                                dp[1][a][b][c][d-1] = max(dp[1][a][b][c][d-1],dp[0][a][b][c][d] + 1);
                            }       
                            else
                            {
                                dp[1][a][b][c][d] = max(dp[1][a][b][c][d],dp[0][a][b][c][d]);
                            }                                                                     
                        }
                        else
                        {
                            dp[1][a][b][c][d] = max(dp[1][a][b][c][d],dp[0][a][b][c][d]);
                        }
                    }
                }
            }
        }      
    }

    int res = 0;
    for(int a=0;a<=m;a++)
    {
        for(int b=0;b<=m;b++)
        {
            for(int c=0;c<=m;c++)
            {
                for(int d=0;d<=m;d++)
                {
                    res = max(res,dp[1][a][b][c][d]);
                }
            }
        }
    }

    cout << res << '\n';

	return 0;
}