結果

問題 No.291 黒い文字列
ユーザー tanzakutanzaku
提出日時 2015-10-16 23:20:59
言語 Java21
(openjdk 21)
結果
AC  
実行時間 375 ms / 2,000 ms
コード長 6,775 bytes
コンパイル時間 2,943 ms
コンパイル使用メモリ 92,528 KB
実行使用メモリ 61,668 KB
最終ジャッジ日時 2024-07-21 20:35:45
合計ジャッジ時間 8,982 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 66 ms
50,716 KB
testcase_01 AC 65 ms
50,312 KB
testcase_02 AC 68 ms
51,096 KB
testcase_03 AC 65 ms
50,976 KB
testcase_04 AC 64 ms
50,356 KB
testcase_05 AC 64 ms
50,744 KB
testcase_06 AC 65 ms
50,848 KB
testcase_07 AC 66 ms
50,844 KB
testcase_08 AC 67 ms
50,732 KB
testcase_09 AC 66 ms
50,924 KB
testcase_10 AC 96 ms
52,248 KB
testcase_11 AC 135 ms
55,532 KB
testcase_12 AC 123 ms
54,440 KB
testcase_13 AC 66 ms
50,720 KB
testcase_14 AC 69 ms
50,824 KB
testcase_15 AC 68 ms
50,944 KB
testcase_16 AC 274 ms
57,660 KB
testcase_17 AC 281 ms
58,236 KB
testcase_18 AC 276 ms
57,640 KB
testcase_19 AC 347 ms
60,068 KB
testcase_20 AC 338 ms
61,668 KB
testcase_21 AC 192 ms
56,376 KB
testcase_22 AC 299 ms
59,988 KB
testcase_23 AC 375 ms
61,268 KB
testcase_24 AC 285 ms
59,564 KB
testcase_25 AC 199 ms
56,796 KB
testcase_26 AC 207 ms
57,172 KB
testcase_27 AC 104 ms
52,764 KB
testcase_28 AC 195 ms
57,092 KB
testcase_29 AC 194 ms
56,592 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;
			}
			
			char[] cs = io.next();
			TreeSet<int[]> set = new TreeSet<>((a,b)->{
				int x = 0, y = 0;
				for(int i = 1; i <= 5; i++) {
//					x += a[i]*i;
//					y += b[i]*i;
					x += a[i]*(1<<(i-1));
					y += b[i]*(1<<(i-1));
				}
				if(x == y) {
					for(int j = 5; j >= 1; j--) {
						if(a[j] != b[j]) {
							return b[j] - a[j];
						}
					}
				}
				return y - x;
			});
			{
				int[] cnt = new int[7];
				cnt[0] = 200;
				set.add(cnt);
			}
			for(int i = 0; i < cs.length; i++) {
				TreeSet<int[]> next = new TreeSet<>((a,b)->{
					int x = 0, y = 0;
					for(int j = 1; j <= 5; j++) {
//						x += a[j]*j;
//						y += b[j]*j;
						x += a[j]*(1<<(j-1));
						y += b[j]*(1<<(j-1));
					}
					if(x == y) {
						for(int j = 5; j >= 1; j--) {
							if(a[j] != b[j]) {
								return b[j] - a[j];
							}
						}
					}
					return y - x;
				});
				for(int[] x : set) {
					for(int j = 4; j >= 0; j--) if(x[j] > 0) {
						if(cs[i] ==  '?' || map[cs[i]] == j) {
							int[] cnt = x.clone();
							cnt[6] = random.nextInt();
							cnt[j]--;
							cnt[j+1]++;
							next.add(cnt);
						}
					}
					next.add(x);
				}
				while(next.size() > 500*2) next.pollLast();
				set = next;
			}
			
			int ans = 0;
			for(int[] x : set) {
				ans = Math.max(ans, x[5]);
//				System.err.println(Arrays.toString(x));
			}
			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