結果

問題 No.437 cwwゲーム
ユーザー hiromi_ayasehiromi_ayase
提出日時 2016-10-28 22:48:31
言語 Java21
(openjdk 21)
結果
RE  
実行時間 -
コード長 3,300 bytes
コンパイル時間 2,651 ms
コンパイル使用メモリ 77,764 KB
実行使用メモリ 38,504 KB
最終ジャッジ日時 2024-11-24 06:07:57
合計ジャッジ時間 6,050 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge4
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 51 ms
36,704 KB
testcase_01 AC 52 ms
36,848 KB
testcase_02 AC 54 ms
36,520 KB
testcase_03 AC 52 ms
36,408 KB
testcase_04 AC 52 ms
36,712 KB
testcase_05 AC 63 ms
36,608 KB
testcase_06 AC 83 ms
38,324 KB
testcase_07 AC 84 ms
38,396 KB
testcase_08 AC 85 ms
37,544 KB
testcase_09 AC 84 ms
38,504 KB
testcase_10 AC 84 ms
37,912 KB
testcase_11 AC 52 ms
36,652 KB
testcase_12 RE -
testcase_13 AC 55 ms
36,536 KB
testcase_14 AC 54 ms
36,604 KB
testcase_15 AC 105 ms
38,424 KB
testcase_16 AC 52 ms
36,276 KB
testcase_17 AC 53 ms
36,136 KB
testcase_18 AC 55 ms
36,604 KB
testcase_19 WA -
testcase_20 AC 51 ms
36,116 KB
testcase_21 AC 51 ms
36,628 KB
testcase_22 AC 51 ms
36,600 KB
testcase_23 AC 53 ms
36,604 KB
testcase_24 AC 52 ms
36,748 KB
testcase_25 AC 52 ms
36,628 KB
testcase_26 AC 53 ms
36,652 KB
testcase_27 AC 53 ms
36,384 KB
testcase_28 AC 53 ms
36,108 KB
testcase_29 AC 52 ms
36,800 KB
testcase_30 AC 53 ms
36,484 KB
testcase_31 AC 52 ms
36,372 KB
testcase_32 AC 52 ms
36,340 KB
testcase_33 AC 52 ms
36,592 KB
testcase_34 AC 52 ms
36,392 KB
testcase_35 AC 51 ms
36,524 KB
testcase_36 AC 52 ms
36,800 KB
testcase_37 AC 52 ms
36,520 KB
testcase_38 AC 53 ms
36,680 KB
testcase_39 AC 57 ms
36,116 KB
testcase_40 AC 52 ms
36,652 KB
testcase_41 AC 53 ms
36,104 KB
testcase_42 AC 52 ms
36,612 KB
testcase_43 AC 53 ms
36,100 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import java.io.IOException;
import java.io.InputStream;
import java.util.NoSuchElementException;

public class Main {
	public static void main(String[] args) {
		FastScanner sc = new FastScanner();
		char[] s = sc.next().toCharArray();
		search(0, s, new boolean[12]);
		System.out.println(max);
	}

	private static int max = 0;

	private static void search(int now, char[] s, boolean[] flg) {
		max = Math.max(max, now);
		for (int i = 0; i < s.length - 2; i++) {
			for (int j = i + 1; j < s.length - 1; j++) {
				for (int k = j + 1; k < s.length; k++) {
					if (!flg[i] && !flg[j] && !flg[k] && s[i] != 0 && s[i] != s[j] && s[j] == s[k]) {
						flg[i] = flg[j] = flg[k] = true;
						int c = s[i] - '0';
						int w = s[j] - '0';
						search(now + c * 100 + w * 11, s, flg);
						flg[i] = flg[j] = flg[k] = false;
					}
				}
			}
		}
	}
}

class FastScanner {
	public static String debug = null;

	private final InputStream in = System.in;
	private int ptr = 0;
	private int buflen = 0;
	private byte[] buffer = new byte[1024];
	private boolean eos = false;

	private boolean hasNextByte() {
		if (ptr < buflen) {
			return true;
		} else {
			ptr = 0;
			try {
				if (debug != null) {
					buflen = debug.length();
					buffer = debug.getBytes();
					debug = "";
					eos = true;
				} else {
					buflen = in.read(buffer);
				}
			} catch (IOException e) {
				e.printStackTrace();
			}
			if (buflen < 0) {
				eos = true;
				return false;
			} else if (buflen == 0) {
				return false;
			}
		}
		return true;
	}

	private int readByte() {
		if (hasNextByte())
			return buffer[ptr++];
		else
			return -1;
	}

	private static boolean isPrintableChar(int c) {
		return 33 <= c && c <= 126;
	}

	private void skipUnprintable() {
		while (hasNextByte() && !isPrintableChar(buffer[ptr]))
			ptr++;
	}

	public boolean isEOS() {
		return this.eos;
	}

	public boolean hasNext() {
		skipUnprintable();
		return hasNextByte();
	}

	public String next() {
		if (!hasNext())
			throw new NoSuchElementException();
		StringBuilder sb = new StringBuilder();
		int b = readByte();
		while (isPrintableChar(b)) {
			sb.appendCodePoint(b);
			b = readByte();
		}
		return sb.toString();
	}

	public long nextLong() {
		if (!hasNext())
			throw new NoSuchElementException();
		long n = 0;
		boolean minus = false;
		int b = readByte();
		if (b == '-') {
			minus = true;
			b = readByte();
		}
		if (b < '0' || '9' < b) {
			throw new NumberFormatException();
		}
		while (true) {
			if ('0' <= b && b <= '9') {
				n *= 10;
				n += b - '0';
			} else if (b == -1 || !isPrintableChar(b)) {
				return minus ? -n : n;
			} else {
				throw new NumberFormatException();
			}
			b = readByte();
		}
	}

	public int nextInt() {
		return (int) nextLong();
	}

	public long[] nextLongList(int n) {
		return nextLongTable(1, n)[0];
	}

	public int[] nextIntList(int n) {
		return nextIntTable(1, n)[0];
	}

	public long[][] nextLongTable(int n, int m) {
		long[][] ret = new long[n][m];
		for (int i = 0; i < n; i++) {
			for (int j = 0; j < m; j++) {
				ret[i][j] = nextLong();
			}
		}
		return ret;
	}

	public int[][] nextIntTable(int n, int m) {
		int[][] ret = new int[n][m];
		for (int i = 0; i < n; i++) {
			for (int j = 0; j < m; j++) {
				ret[i][j] = nextInt();
			}
		}
		return ret;
	}
}
0