結果

問題 No.291 黒い文字列
コンテスト
ユーザー sugim48
提出日時 2015-10-16 22:59:04
言語 C++11
(gcc 15.2.0 + boost 1.89.0)
コンパイル:
g++-15 -O2 -lm -std=gnu++11 -Wuninitialized -DONLINE_JUDGE -o a.out _filename_
実行:
./a.out
結果
RE  
実行時間 -
コード長 2,068 bytes
記録
記録タグの例:
初AC ショートコード 純ショートコード 純主流ショートコード 最速実行時間
コンパイル時間 723 ms
コンパイル使用メモリ 108,456 KB
実行使用メモリ 7,972 KB
最終ジャッジ日時 2026-04-03 05:50:30
合計ジャッジ時間 6,577 ms
ジャッジサーバーID
（参考情報） 		judge2_1 / judge5_1
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample RE * 4
other RE * 26
権限があれば一括ダウンロードができます
コンパイルメッセージ
In file included from /home/linuxbrew/.linuxbrew/Cellar/gcc/15.2.0_1/include/c++/15/algorithm:62,
                 from main.cpp:2:
In function 'const _Tp& std::max(const _Tp&, const _Tp&) [with _Tp = int]',
    inlined from 'int main()' at main.cpp:72:16:
/home/linuxbrew/.linuxbrew/Cellar/gcc/15.2.0_1/include/c++/15/bits/stl_algobase.h:263:15: warning: iteration 21 invokes undefined behavior [-Waggressive-loop-optimizations]
  263 |       if (__a < __b)
      |           ~~~~^~~~~
main.cpp: In function 'int main()':
main.cpp:71:51: note: within this loop
   71 |                                 for (int o = 0; o <= 25; o++)
      |                                                 ~~^~~~~
main.cpp:41:56: warning: iteration 21 invokes undefined behavior [-Waggressive-loop-optimizations]
   41 |                                         dp[k][u][r][o] = -1;
      |                                         ~~~~~~~~~~~~~~~^~~~
main.cpp:40:51: note: within this loop
   40 |                                 for (int o = 0; o <= 25; o++) {
      |                                                 ~~^~~~~
In function 'const _Tp& std::max(const _Tp&, const _Tp&) [with _Tp = int]',
    inlined from 'int main()' at main.cpp:72:16:
/home/linuxbrew/.linuxbrew/Cellar/gcc/15.2.0_1/include/c++/15/bits/stl_algobase.h:263:15: warning: iteration 21 invokes undefined behavior [-Waggressive-loop-optimizations]
  263 |       if (__a < __b)
      |           ~~~~^~~~~
main.cpp: In function 'int main()':
main.cpp:68:27: note: within this loop
   68 |         for (int k = 0; k <= 100; k++)
      |                         ~~^~~~~~
In function 'const _Tp& std::max(const _Tp&, const _Tp&) [with _Tp = int]',
    inlined from 'int main()' at main.cpp:72:16:
/home/linuxbrew/.linuxbrew/Cellar/gcc/15.2.0_1/include/c++/15/bits/stl_algobase.h:263:15: warning: iteration 21 invokes undefined behavior [-Waggressive-loop-optimizations]
  263 |       if (__a < __b)
      |           ~~~~^~~~~
main.cpp: In functio

ソースコード

diff #
raw source code 

#define _USE_MATH_DEFINES
#include <algorithm>
#include <cstdio>
#include <functional>
#include <iostream>
#include <cfloat>
#include <climits>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <time.h>
#include <vector>
using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> i_i;
typedef pair<ll, int> ll_i;
typedef pair<double, int> d_i;
typedef pair<ll, ll> ll_ll;
typedef pair<double, double> d_d;
struct edge { int v, c; };

ll MOD = 1000000007;
ll _MOD = 1000000009;
double EPS = 1e-10;

int dp[21][21][21][21], _dp[21][21][21][21];

int main() {
	for (int k = 0; k <= 100; k++)
		for (int u = 0; u <= 50; u++)
			for (int r = 0; r <= 33; r++)
				for (int o = 0; o <= 25; o++) {
					dp[k][u][r][o] = -1;
					_dp[k][u][r][o] = -1;
				}
	dp[0][0][0][0] = 0;
	string S; cin >> S;
	for (int i = 0; i < S.length(); i++) {
		char c = S[i];
		for (int k = 0; k <= 20; k++)
		for (int u = 0; u <= 20; u++)
			for (int r = 0; r <= 20; r++)
				for (int o = 0; o <= 20; o++) {
						if (dp[k][u][r][o] == -1) continue;
						_dp[k][u][r][o] = max(_dp[k][u][r][o], dp[k][u][r][o]);
						if (c == 'K' || c == '?')
							_dp[k + 1][u][r][o] = max(_dp[k + 1][u][r][o], dp[k][u][r][o]);
						if ((c == 'U' || c == '?') && k >= 1)
							_dp[k - 1][u + 1][r][o] = max(_dp[k - 1][u + 1][r][o], dp[k][u][r][o]);
						if ((c == 'R' || c == '?') && u >= 1)
							_dp[k][u - 1][r + 1][o] = max(_dp[k][u - 1][r + 1][o], dp[k][u][r][o]);
						if ((c == 'O' || c == '?') && r >= 1)
							_dp[k][u][r - 1][o + 1] = max(_dp[k][u][r - 1][o + 1], dp[k][u][r][o]);
						if ((c == 'I' || c == '?') && o >= 1)
							_dp[k][u][r][o - 1] = max(_dp[k][u][r][o - 1], dp[k][u][r][o] + 1);
					}
		swap(dp, _dp);
	}
	int maxi = 0;
	for (int k = 0; k <= 100; k++)
		for (int u = 0; u <= 50; u++)
			for (int r = 0; r <= 33; r++)
				for (int o = 0; o <= 25; o++)
					maxi = max(maxi, dp[k][u][r][o]);
	cout << maxi << endl;
}
0