結果

問題 No.519 アイドルユニット
ユーザー uwiuwi
提出日時 2017-05-28 22:43:22
言語 Java21
(openjdk 21)
結果
AC  
実行時間 368 ms / 1,000 ms
コード長 3,930 bytes
コンパイル時間 3,532 ms
コンパイル使用メモリ 85,936 KB
実行使用メモリ 105,036 KB
最終ジャッジ日時 2024-10-03 03:49:55
合計ジャッジ時間 9,203 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 368 ms
104,788 KB
testcase_01 AC 364 ms
105,036 KB
testcase_02 AC 142 ms
55,716 KB
testcase_03 AC 83 ms
39,416 KB
testcase_04 AC 49 ms
36,712 KB
testcase_05 AC 47 ms
37,012 KB
testcase_06 AC 48 ms
36,876 KB
testcase_07 AC 48 ms
36,980 KB
testcase_08 AC 50 ms
36,696 KB
testcase_09 AC 54 ms
36,708 KB
testcase_10 AC 79 ms
38,220 KB
testcase_11 AC 82 ms
39,404 KB
testcase_12 AC 47 ms
36,860 KB
testcase_13 AC 85 ms
39,180 KB
testcase_14 AC 84 ms
39,628 KB
testcase_15 AC 90 ms
39,380 KB
testcase_16 AC 87 ms
39,240 KB
testcase_17 AC 83 ms
39,108 KB
testcase_18 AC 81 ms
39,132 KB
testcase_19 AC 85 ms
39,364 KB
testcase_20 AC 92 ms
39,268 KB
testcase_21 AC 82 ms
39,216 KB
testcase_22 AC 86 ms
39,296 KB
testcase_23 AC 80 ms
39,092 KB
testcase_24 AC 88 ms
42,300 KB
testcase_25 AC 97 ms
42,348 KB
testcase_26 AC 96 ms
42,348 KB
testcase_27 AC 91 ms
42,244 KB
testcase_28 AC 100 ms
42,428 KB
testcase_29 AC 367 ms
104,772 KB
testcase_30 AC 363 ms
104,880 KB
testcase_31 AC 368 ms
104,748 KB
testcase_32 AC 368 ms
104,876 KB
testcase_33 AC 47 ms
36,596 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

package contest170528;
import java.io.ByteArrayInputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.InputMismatchException;

public class D {
	InputStream is;
	PrintWriter out;
	String INPUT = "";
	
	void solve()
	{
		int n = ni();
		int[][] a = new int[n][];
		for(int i = 0;i < n;i++){
			a[i] = na(n);
		}
		
		int[] magic = {0, 1, 23, 2, 29, 24, 19, 3, 30, 27, 25, 11, 20, 8, 4, 13, 31, 22, 28, 18, 26, 10, 7, 12, 21, 17, 9, 6, 16, 5, 15, 14};
		int[] dp = new int[1<<n];
		for(int i = 1;i < 1<<n;i++){
			if((Integer.bitCount(i)&1) == 0){
				int j = Integer.numberOfTrailingZeros(i);
				int h = i&i-1;
				int[] w = a[j];
				for(int u = h;u != 0;u &= u-1){
//					int k = Integer.numberOfTrailingZeros(u);
					int k = magic[(u&-u)*0x076be629>>>27];
					dp[i] = Math.max(dp[i], dp[h^1<<k] + w[k]);
				}
			}
		}
		out.println(dp[(1<<n)-1]);
		
	}
	
	void run() throws Exception
	{
//		int n = 24, m = 99999;
//		Random gen = new Random();
//		StringBuilder sb = new StringBuilder();
//		sb.append(n + " ");
//		for (int i = 0; i < n; i++) {
//			for(int j = 0;j < n;j++){
//				sb.append(gen.nextInt(1000) + " ");
//			}
//		}
//		INPUT = sb.toString();

		
		is = INPUT.isEmpty() ? System.in : new ByteArrayInputStream(INPUT.getBytes());
		out = new PrintWriter(System.out);
		
		long s = System.currentTimeMillis();
		solve();
		out.flush();
		if(!INPUT.isEmpty())tr(System.currentTimeMillis()-s+"ms");
//		Thread t = new Thread(null, null, "~", Runtime.getRuntime().maxMemory()){
//			@Override
//			public void run() {
//				long s = System.currentTimeMillis();
//				solve();
//				out.flush();
//				if(!INPUT.isEmpty())tr(System.currentTimeMillis()-s+"ms");
//			}
//		};
//		t.start();
//		t.join();
	}
	
	public static void main(String[] args) throws Exception { new D().run(); }
	
	private byte[] inbuf = new byte[1024];
	public int lenbuf = 0, ptrbuf = 0;
	
	private int readByte()
	{
		if(lenbuf == -1)throw new InputMismatchException();
		if(ptrbuf >= lenbuf){
			ptrbuf = 0;
			try { lenbuf = is.read(inbuf); } catch (IOException e) { throw new InputMismatchException(); }
			if(lenbuf <= 0)return -1;
		}
		return inbuf[ptrbuf++];
	}
	
	private boolean isSpaceChar(int c) { return !(c >= 33 && c <= 126); }
	private int skip() { int b; while((b = readByte()) != -1 && isSpaceChar(b)); return b; }
	
	private double nd() { return Double.parseDouble(ns()); }
	private char nc() { return (char)skip(); }
	
	private String ns()
	{
		int b = skip();
		StringBuilder sb = new StringBuilder();
		while(!(isSpaceChar(b))){ // when nextLine, (isSpaceChar(b) && b != ' ')
			sb.appendCodePoint(b);
			b = readByte();
		}
		return sb.toString();
	}
	
	private char[] ns(int n)
	{
		char[] buf = new char[n];
		int b = skip(), p = 0;
		while(p < n && !(isSpaceChar(b))){
			buf[p++] = (char)b;
			b = readByte();
		}
		return n == p ? buf : Arrays.copyOf(buf, p);
	}
	
	private int[] na(int n)
	{
		int[] a = new int[n];
		for(int i = 0;i < n;i++)a[i] = ni();
		return a;
	}
	
	private long[] nal(int n)
	{
		long[] a = new long[n];
		for(int i = 0;i < n;i++)a[i] = nl();
		return a;
	}
	
	private char[][] nm(int n, int m) {
		char[][] map = new char[n][];
		for(int i = 0;i < n;i++)map[i] = ns(m);
		return map;
	}
	
	private int[][] nmi(int n, int m) {
		int[][] map = new int[n][];
		for(int i = 0;i < n;i++)map[i] = na(m);
		return map;
	}
	
	private int ni() { return (int)nl(); }
	
	private long nl()
	{
		long num = 0;
		int b;
		boolean minus = false;
		while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));
		if(b == '-'){
			minus = true;
			b = readByte();
		}
		
		while(true){
			if(b >= '0' && b <= '9'){
				num = num * 10 + (b - '0');
			}else{
				return minus ? -num : num;
			}
			b = readByte();
		}
	}
	
	private static void tr(Object... o) { System.out.println(Arrays.deepToString(o)); }
}
0