#126560 (Java21) No.437 cwwゲーム

提出ソース

結果

問題	No.437 cwwゲーム
ユーザー	tanzaku
提出日時	2016-10-28 22:27:21
言語	Java21 (openjdk 21)
結果	WA
実行時間	-
コード長	6,222 bytes
コンパイル時間	4,861 ms
コンパイル使用メモリ	83,124 KB
実行使用メモリ	37,644 KB
最終ジャッジ日時	2024-11-24 06:51:10
合計ジャッジ時間	8,057 ms
ジャッジサーバーID （参考情報）	judge5 / judge4

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	53 ms 37,280 KB
testcase_01	AC	54 ms 36,764 KB
testcase_02	AC	53 ms 36,916 KB
testcase_03	AC	53 ms 36,884 KB
testcase_04	AC	52 ms 36,928 KB
testcase_05	AC	57 ms 37,108 KB
testcase_06	AC	59 ms 37,128 KB
testcase_07	AC	58 ms 37,288 KB
testcase_08	AC	58 ms 37,356 KB
testcase_09	AC	59 ms 37,644 KB
testcase_10	AC	56 ms 36,900 KB
testcase_11	AC	52 ms 37,104 KB
testcase_12	AC	54 ms 37,300 KB
testcase_13	AC	54 ms 37,208 KB
testcase_14	AC	55 ms 37,260 KB
testcase_15	AC	61 ms 36,916 KB
testcase_16	AC	55 ms 37,260 KB
testcase_17	AC	54 ms 37,336 KB
testcase_18	AC	53 ms 37,096 KB
testcase_19	WA	-
testcase_20	AC	54 ms 37,364 KB
testcase_21	AC	55 ms 37,292 KB
testcase_22	AC	55 ms 37,004 KB
testcase_23	AC	53 ms 37,052 KB
testcase_24	AC	52 ms 37,052 KB
testcase_25	AC	53 ms 37,052 KB
testcase_26	AC	53 ms 37,284 KB
testcase_27	AC	55 ms 37,052 KB
testcase_28	AC	52 ms 36,840 KB
testcase_29	AC	53 ms 37,052 KB
testcase_30	AC	53 ms 37,048 KB
testcase_31	AC	54 ms 37,052 KB
testcase_32	AC	52 ms 37,408 KB
testcase_33	AC	54 ms 36,876 KB
testcase_34	AC	54 ms 37,068 KB
testcase_35	AC	54 ms 36,860 KB
testcase_36	AC	53 ms 36,848 KB
testcase_37	AC	52 ms 37,232 KB
testcase_38	AC	52 ms 37,204 KB
testcase_39	AC	52 ms 36,920 KB
testcase_40	AC	50 ms 37,020 KB
testcase_41	AC	52 ms 37,092 KB
testcase_42	AC	54 ms 37,184 KB
testcase_43	AC	52 ms 37,036 KB

権限があれば一括ダウンロードができます

ソースコード

raw source code

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

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();

//	TreeMap<Integer, Integer>[] comb = new TreeMap[100000];
	
	/// 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) {
			char[] cs = io.next();
			int[] dp = new int[1<<cs.length];
			Arrays.fill(dp, -1);
			dp[0] = 0;
			for (int i = 0; i < dp.length; i++) if (dp[i] != -1) {
				for (int j = 0; j < cs.length; j++) {
					for (int k = j + 1; k < cs.length; k++) {
						for (int l = k + 1; l < cs.length; l++) {
							final int f = 1 << l | 1 << j | 1 << k;
							if((i & f) == 0) {
								if (cs[j] != cs[k] && cs[k] == cs[l]) {
									int v = (cs[j] - '0') * 100 + (cs[k] - '0') * 10 + cs[l] - '0';
									dp[i | f] = Math.max(dp[i | f], dp[i] + v);
								}
							}
						}
					}
				}
			}
			int ans = 0;
			for (int v : dp) ans = Math.max(ans, v);
			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; }

	void printArrayLn(int[] xs) { for(int i = 0; i < xs.length; i++) io.out.print(xs[i] + (i==xs.length-1?"\n":" ")); }
	void printArrayLn(long[] xs) { for(int i = 0; i < xs.length; i++) io.out.print(xs[i] + (i==xs.length-1?"\n":" ")); }
	
	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; }
	}
}

yukicoder

結果

テストケース

ソースコード