結果

問題 No.519 アイドルユニット
ユーザー GrenacheGrenache
提出日時 2017-05-29 23:30:49
言語 Java21
(openjdk 21)
結果
AC  
実行時間 138 ms / 1,000 ms
コード長 4,456 bytes
コンパイル時間 3,700 ms
コンパイル使用メモリ 79,032 KB
実行使用メモリ 120,428 KB
最終ジャッジ日時 2024-04-14 06:40:06
合計ジャッジ時間 8,022 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 135 ms
120,332 KB
testcase_01 AC 137 ms
120,428 KB
testcase_02 AC 111 ms
71,072 KB
testcase_03 AC 85 ms
51,296 KB
testcase_04 AC 55 ms
50,520 KB
testcase_05 AC 55 ms
50,620 KB
testcase_06 AC 55 ms
50,176 KB
testcase_07 AC 57 ms
50,500 KB
testcase_08 AC 57 ms
50,648 KB
testcase_09 AC 56 ms
50,528 KB
testcase_10 AC 59 ms
50,384 KB
testcase_11 AC 84 ms
51,200 KB
testcase_12 AC 55 ms
50,644 KB
testcase_13 AC 86 ms
51,408 KB
testcase_14 AC 83 ms
51,428 KB
testcase_15 AC 86 ms
51,468 KB
testcase_16 AC 77 ms
51,440 KB
testcase_17 AC 83 ms
51,428 KB
testcase_18 AC 89 ms
51,604 KB
testcase_19 AC 83 ms
51,332 KB
testcase_20 AC 83 ms
51,504 KB
testcase_21 AC 85 ms
51,368 KB
testcase_22 AC 83 ms
51,332 KB
testcase_23 AC 86 ms
51,140 KB
testcase_24 AC 100 ms
55,816 KB
testcase_25 AC 109 ms
55,908 KB
testcase_26 AC 100 ms
56,004 KB
testcase_27 AC 104 ms
56,228 KB
testcase_28 AC 105 ms
55,984 KB
testcase_29 AC 135 ms
120,252 KB
testcase_30 AC 137 ms
120,216 KB
testcase_31 AC 136 ms
120,412 KB
testcase_32 AC 138 ms
120,004 KB
testcase_33 AC 55 ms
50,428 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

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


public class Main_yukicoder519 {

	private static Scanner sc;
	private static Printer pr;

	private static void solve() {
		int n = sc.nextInt();


		int[][] f = new int[n][n];
		for (int i = 0; i < n; i++) {
			for (int j = 0; j < n; j++) {
				f[i][j] = sc.nextInt();
			}
		}

		int[] dp = new int[0x1 << n];
		Arrays.fill(dp, -1);
		dp[0] = 0;

		for (int i = 0; i < 0x1 << n; i++) {
			if (dp[i] >= 0) {
				int j = Integer.numberOfTrailingZeros(~i);
				int mtmp = i | 0x1 << j;

				for (int k = j + 1; k < n; k++) {
					int mtmp2 = mtmp | 0x1 << k;
					if (mtmp2 == mtmp) {
						continue;
					}

					dp[mtmp2] = Math.max(dp[mtmp2], dp[i] + f[j][k]);
				}

			}
		}

		pr.println(dp[(0x1 << n) - 1]);
	}

	// ---------------------------------------------------
	public static void main(String[] args) {
		sc = new Scanner(System.in);
		pr = new Printer(System.out);

		solve();

		pr.close();
		sc.close();
	}

	@SuppressWarnings("unused")
	private static class Scanner {
		BufferedReader br;

		Scanner (InputStream in) {
			br = new BufferedReader(new InputStreamReader(in));
		}

		private boolean isPrintable(int ch) {
			return ch >= '!' && ch <= '~';
		}

		private boolean isCRLF(int ch) {
			return ch == '\n' || ch == '\r' || ch == -1;
		}

		private int nextPrintable() {
			try {
				int ch;
				while (!isPrintable(ch = br.read())) {
					if (ch == -1) {
						throw new NoSuchElementException();
					}
				}

				return ch;
			} catch (IOException e) {
				throw new NoSuchElementException();
			}
		}

		String next() {
			try {
				int ch = nextPrintable();
				StringBuilder sb = new StringBuilder();
				do {
					sb.appendCodePoint(ch);
				} while (isPrintable(ch = br.read()));

				return sb.toString();
			} catch (IOException e) {
				throw new NoSuchElementException();
			}
		}

		int nextInt() {
			try {
				// parseInt from Integer.parseInt()
				boolean negative = false;
				int res = 0;
				int limit = -Integer.MAX_VALUE;
				int radix = 10;

				int fc = nextPrintable();
				if (fc < '0') {
					if (fc == '-') {
						negative = true;
						limit = Integer.MIN_VALUE;
					} else if (fc != '+') {
						throw new NumberFormatException();
					}
					fc = br.read();
				}
				int multmin = limit / radix;

				int ch = fc;
				do {
					int digit = ch - '0';
					if (digit < 0 || digit >= radix) {
						throw new NumberFormatException();
					}
					if (res < multmin) {
						throw new NumberFormatException();
					}
					res *= radix;
					if (res < limit + digit) {
						throw new NumberFormatException();
					}
					res -= digit;

				} while (isPrintable(ch = br.read()));

				return negative ? res : -res;
			} catch (IOException e) {
				throw new NoSuchElementException();
			}
		}

		long nextLong() {
			try {
				// parseLong from Long.parseLong()
				boolean negative = false;
				long res = 0;
				long limit = -Long.MAX_VALUE;
				int radix = 10;

				int fc = nextPrintable();
				if (fc < '0') {
					if (fc == '-') {
						negative = true;
						limit = Long.MIN_VALUE;
					} else if (fc != '+') {
						throw new NumberFormatException();
					}
					fc = br.read();
				}
				long multmin = limit / radix;

				int ch = fc;
				do {
					int digit = ch - '0';
					if (digit < 0 || digit >= radix) {
						throw new NumberFormatException();
					}
					if (res < multmin) {
						throw new NumberFormatException();
					}
					res *= radix;
					if (res < limit + digit) {
						throw new NumberFormatException();
					}
					res -= digit;

				} while (isPrintable(ch = br.read()));

				return negative ? res : -res;
			} catch (IOException e) {
				throw new NoSuchElementException();
			}
		}

		float nextFloat() {
			return Float.parseFloat(next());
		}

		double nextDouble() {
			return Double.parseDouble(next());
		}

		String nextLine() {
			try {
				int ch;
				while (isCRLF(ch = br.read())) {
					if (ch == -1) {
						throw new NoSuchElementException();
					}
				}
				StringBuilder sb = new StringBuilder();
				do {
					sb.appendCodePoint(ch);
				} while (!isCRLF(ch = br.read()));

				return sb.toString();
			} catch (IOException e) {
				throw new NoSuchElementException();
			}
		}

		void close() {
			try {
				br.close();
			} catch (IOException e) {
//				throw new NoSuchElementException();
			}
		}
	}

	private static class Printer extends PrintWriter {
		Printer(PrintStream out) {
			super(out);
		}
	}
}
0