結果

問題 No.291 黒い文字列
ユーザー nebukuro09
提出日時 2017-06-10 10:13:36
言語 D
(dmd 2.109.1)
結果
RE  
実行時間 -
コード長 2,361 bytes
コンパイル時間 678 ms
コンパイル使用メモリ 110,760 KB
実行使用メモリ 111,848 KB
最終ジャッジ日時 2024-06-12 19:53:01
合計ジャッジ時間 9,261 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge5
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 4
other AC * 13 RE * 13
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

import std.stdio, std.array, std.string, std.conv, std.algorithm;
import std.typecons, std.range, std.random, std.math, std.container;
import std.numeric, std.bigint, core.bitop, core.stdc.stdio;
void main() {
    auto S = readln.chomp;
    auto N = S.length.to!int;
    immutable int M = 21;
    auto dp = new int[][][][][](N+1, M, M, M, M);
    foreach (i; 0..N+1)
        foreach (a; 0..M)
            foreach (b; 0..M)
                foreach (c; 0..M)
                    fill(dp[i][a][b][c], -1);
    dp[0][0][0][0][0] = 0;
    foreach (i; 0..N) {
        foreach (a; 0..M) {
            foreach (b; 0..a+1) {
                foreach (c; 0..b+1) {
                    foreach (d; 0..c+1) {
                        if (dp[i][a][b][c][d] < 0) continue;
                        else if (S[i] == 'K') dp[i+1][a+1][b][c][d] = max(dp[i][a][b][c][d], dp[i+1][a+1][b][c][d]);
                        else if (S[i] == 'U') dp[i+1][a][b+1][c][d] = max(dp[i][a][b][c][d], dp[i+1][a][b+1][c][d]);
                        else if (S[i] == 'R') dp[i+1][a][b][c+1][d] = max(dp[i][a][b][c][d], dp[i+1][a][b][c+1][d]);
                        else if (S[i] == 'O') dp[i+1][a][b][c][d+1] = max(dp[i][a][b][c][d], dp[i+1][a][b][c][d+1]);
                        else if (S[i] == 'I' && min(a, b, c, d) > 0) dp[i+1][a-1][b-1][c-1][d-1] = max(dp[i][a][b][c][d] + 1, dp[i+1][a-1][b-1][c-1][d
                            -1]);
                        else if (S[i] == '?') {
                            dp[i+1][a+1][b][c][d] = max(dp[i][a][b][c][d], dp[i+1][a+1][b][c][d]);
                            dp[i+1][a][b+1][c][d] = max(dp[i][a][b][c][d], dp[i+1][a][b+1][c][d]);
                            dp[i+1][a][b][c+1][d] = max(dp[i][a][b][c][d], dp[i+1][a][b][c+1][d]);
                            dp[i+1][a][b][c][d+1] = max(dp[i][a][b][c][d], dp[i+1][a][b][c][d+1]);
                            if (min(a, b, c, d) > 0) dp[i+1][a-1][b-1][c-1][d-1] = max(dp[i][a][b][c][d] + 1, dp[i+1][a-1][b-1][c-1][d-1]);
                        }
                        dp[i+1][a][b][c][d] = max(dp[i][a][b][c][d], dp[i+1][a][b][c][d]);
                    }
                }
            }
        }
    }
    int ans = 0;
    foreach (a; 0..M)
        foreach (b; 0..M)
            foreach (c; 0..M)
                foreach (d; 0..M)
                    ans = max(ans, dp[N][a][b][c][d]);
    ans.writeln;
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0