結果

問題 No.291 黒い文字列
ユーザー tanzakutanzaku
提出日時 2015-10-16 23:39:34
言語 Java21
(openjdk 21)
結果
AC  
実行時間 1,214 ms / 2,000 ms
コード長 7,003 bytes
コンパイル時間 2,501 ms
コンパイル使用メモリ 78,196 KB
実行使用メモリ 81,680 KB
最終ジャッジ日時 2023-09-29 01:59:43
合計ジャッジ時間 20,910 ms
ジャッジサーバーID
（参考情報） 		judge15 / judge14
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 176 ms
56,324 KB
testcase_01 AC 166 ms
57,048 KB
testcase_02 AC 269 ms
58,004 KB
testcase_03 AC 237 ms
57,112 KB
testcase_04 AC 166 ms
56,928 KB
testcase_05 AC 227 ms
57,196 KB
testcase_06 AC 206 ms
57,068 KB
testcase_07 AC 202 ms
58,000 KB
testcase_08 AC 256 ms
58,844 KB
testcase_09 AC 168 ms
57,888 KB
testcase_10 AC 321 ms
58,136 KB
testcase_11 AC 341 ms
58,328 KB
testcase_12 AC 508 ms
59,160 KB
testcase_13 AC 166 ms
57,392 KB
testcase_14 AC 316 ms
58,336 KB
testcase_15 AC 234 ms
57,180 KB
testcase_16 AC 1,214 ms
70,308 KB
testcase_17 AC 1,138 ms
70,196 KB
testcase_18 AC 1,094 ms
81,680 KB
testcase_19 AC 953 ms
58,536 KB
testcase_20 AC 905 ms
58,572 KB
testcase_21 AC 540 ms
58,428 KB
testcase_22 AC 748 ms
58,888 KB
testcase_23 AC 835 ms
58,764 KB
testcase_24 AC 832 ms
58,856 KB
testcase_25 AC 587 ms
57,940 KB
testcase_26 AC 536 ms
57,768 KB
testcase_27 AC 536 ms
57,868 KB
testcase_28 AC 556 ms
58,148 KB
testcase_29 AC 582 ms
57,908 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import java.io.*;
import java.math.*;
import java.util.*;

import javax.management.RuntimeErrorException;

import static java.util.Arrays.*;

public class Main {
	private static final int mod = (int)1e9+7;

	final Random random = new Random(0);
	final IOFast io = new IOFast();

	/// MAIN CODE
	public void run() throws IOException {
//		int TEST_CASE = Integer.parseInt(new String(io.nextLine()).trim());
		int TEST_CASE = 1;
		while(TEST_CASE-- != 0) {
			int[] map = new int[256];
			Arrays.fill(map, -1);
			for(int i = 0; i < "KUROI".length(); i++) {
				map["KUROI".charAt(i)] = i;
			}
			
			int[][][][][] dp = new int[2][21][21][21][21];
			for(int i = 0; i < 21; i++) {
				for(int j = 0; j < 21; j++) {
					for(int k = 0; k < 21; k++) {
						for(int l = 0; l < 21; l++) {
							dp[0][i][j][k][l] = dp[1][i][j][k][l] = Integer.MIN_VALUE;
						}
					}
				}
			}
			
			dp[0][0][0][0][0] = 0;
			
			int p = 0;
			for(char c : io.next()) {
				final int q = p^1;
				
				for(int i = 0; i < 21; i++) {
					for(int j = 0; j < 21; j++) {
						for(int k = 0; k < 21; k++) {
							for(int l = 0; l < 21; l++) {
								dp[q][i][j][k][l] = Math.max(dp[q][i][j][k][l], dp[p][i][j][k][l]);
								if(          i > 0 && (c ==  '?' || c == 'K')) { dp[q][i][j][k][l] = Math.max(dp[q][i][j][k][l], dp[p][i-1][j  ][k  ][l  ]); }
								if(i < 20 && j > 0 && (c ==  '?' || c == 'U')) { dp[q][i][j][k][l] = Math.max(dp[q][i][j][k][l], dp[p][i+1][j-1][k  ][l  ]); }
								if(j < 20 && k > 0 && (c ==  '?' || c == 'R')) { dp[q][i][j][k][l] = Math.max(dp[q][i][j][k][l], dp[p][i  ][j+1][k-1][l  ]); }
								if(k < 20 && l > 0 && (c ==  '?' || c == 'O')) { dp[q][i][j][k][l] = Math.max(dp[q][i][j][k][l], dp[p][i  ][j  ][k+1][l-1]); }
								if(l < 20 &&          (c ==  '?' || c == 'I')) { dp[q][i][j][k][l] = Math.max(dp[q][i][j][k][l], dp[p][i  ][j  ][k  ][l+1]+1); }
							}
						}
					}
				}
				
				p = q;
			}
			
			int ans = 0;
			for(int i = 0; i < 21; i++) {
				for(int j = 0; j < 21; j++) {
					for(int k = 0; k < 21; k++) {
						for(int l = 0; l < 21; l++) {
							ans = Math.max(ans, dp[p][i][j][k][l]);
						}
					}
				}
			}
			
			io.out.println(ans);
		}
	}
	
	/// TEMPLATE
	static int gcd(int n, int r) { return r == 0 ? n : gcd(r, n%r); }
	static long gcd(long n, long r) { return r == 0 ? n : gcd(r, n%r); }
	
	static <T> void swap(T[] x, int i, int j) { T t = x[i]; x[i] = x[j]; x[j] = t; }
	static void swap(int[] x, int i, int j) { int t = x[i]; x[i] = x[j]; x[j] = t; }
	
	static void dump(Object... o) { System.err.println(Arrays.deepToString(o)); } 
	
	void main() throws IOException {
		//		IOFast.setFileIO("rle-size.in", "rle-size.out");
		try { run(); }
		catch (EndOfFileRuntimeException e) { }
		io.out.flush();
	}
	public static void main(String[] args) throws IOException { new Main().main(); }
	
	static class EndOfFileRuntimeException extends RuntimeException {
		private static final long serialVersionUID = -8565341110209207657L; }

	static
	public class IOFast {
		private BufferedReader in = new BufferedReader(new InputStreamReader(System.in));
		private PrintWriter out = new PrintWriter(System.out);

		void setFileIn(String ins) throws IOException { in.close(); in = new BufferedReader(new FileReader(ins)); }
		void setFileOut(String outs) throws IOException { out.flush(); out.close(); out = new PrintWriter(new FileWriter(outs)); }
		void setFileIO(String ins, String outs) throws IOException { setFileIn(ins); setFileOut(outs); }

		private static int pos, readLen;
		private static final char[] buffer = new char[1024 * 8];
		private static char[] str = new char[500*8*2];
		private static boolean[] isDigit = new boolean[256];
		private static boolean[] isSpace = new boolean[256];
		private static boolean[] isLineSep = new boolean[256];

		static { for(int i = 0; i < 10; i++) { isDigit['0' + i] = true; } isDigit['-'] = true; isSpace[' '] = isSpace['\r'] = isSpace['\n'] = isSpace['\t'] = true; isLineSep['\r'] = isLineSep['\n'] = true; }
		public int read() throws IOException { if(pos >= readLen) { pos = 0; readLen = in.read(buffer); if(readLen <= 0) { throw new EndOfFileRuntimeException(); } } return buffer[pos++]; }
		public int nextInt() throws IOException { int len = 0; str[len++] = nextChar(); len = reads(len, isSpace); int i = 0; int ret = 0; if(str[0] == '-') { i = 1; } for(; i < len; i++) ret = ret * 10 + str[i] - '0'; if(str[0] == '-') { ret = -ret; } return ret; }
		public long nextLong() throws IOException { int len = 0; str[len++] = nextChar(); len = reads(len, isSpace); int i = 0; long ret = 0; if(str[0] == '-') { i = 1; } for(; i < len; i++) ret = ret * 10 + str[i] - '0'; if(str[0] == '-') { ret = -ret; } return ret; }
		public char nextChar() throws IOException { while(true) { final int c = read(); if(!isSpace[c]) { return (char)c; } } }
		int reads(int len, boolean[] accept) throws IOException { try { while(true) { final int c = read(); if(accept[c]) { break; } if(str.length == len) { char[] rep = new char[str.length * 3 / 2]; System.arraycopy(str, 0, rep, 0, str.length); str = rep; } str[len++] = (char)c; } } catch(EndOfFileRuntimeException e) { ; } return len; }
		int reads(char[] cs, int len, boolean[] accept) throws IOException { try { while(true) { final int c = read(); if(accept[c]) { break; } cs[len++] = (char)c; } } catch(EndOfFileRuntimeException e) { ; } return len; }
		public char[] nextLine() throws IOException { int len = 0; str[len++] = nextChar(); len = reads(len, isLineSep); try { if(str[len-1] == '\r') { len--; read(); } } catch(EndOfFileRuntimeException e) { ; } return Arrays.copyOf(str, len); }
		public String nextString() throws IOException { return new String(next()); }
		public char[] next() throws IOException { int len = 0; str[len++] = nextChar(); len = reads(len, isSpace); return Arrays.copyOf(str, len); }
//		public int next(char[] cs) throws IOException { int len = 0; cs[len++] = nextChar(); len = reads(cs, len, isSpace); return len; }
		public double nextDouble() throws IOException { return Double.parseDouble(nextString()); }
		public long[] nextLongArray(final int n) throws IOException { final long[] res = new long[n]; for(int i = 0; i < n; i++) { res[i] = nextLong(); } return res; }
		public int[] nextIntArray(final int n) throws IOException { final int[] res = new int[n]; for(int i = 0; i < n; i++) { res[i] = nextInt(); } return res; }
		public int[][] nextIntArray2D(final int n, final int k) throws IOException { final int[][] res = new int[n][]; for(int i = 0; i < n; i++) { res[i] = nextIntArray(k); } return res; }
		public int[][] nextIntArray2DWithIndex(final int n, final int k) throws IOException { final int[][] res = new int[n][k+1]; for(int i = 0; i < n; i++) { for(int j = 0; j < k; j++) { res[i][j] = nextInt(); } res[i][k] = i; } return res; }
		public double[] nextDoubleArray(final int n) throws IOException { final double[] res = new double[n]; for(int i = 0; i < n; i++) { res[i] = nextDouble(); } return res; }
	}
}
0