結果

提出番号 1629
提出者 uwi_
言語 Java
提出日時 2018-08-04 13:18:19
問題名 (70)アルゴリズムのお勉強
結果 AC
点数 100%

テストケース

テストケース 結果 得点 実行時間 メモリ使用量
1 AC 100% 55ms 93312KB
2 AC 100% 66ms 93456KB
3 AC 100% 59ms 93168KB
4 AC 100% 60ms 93552KB
5 AC 100% 63ms 92752KB
6 AC 100% 53ms 93168KB
7 AC 100% 58ms 92976KB
8 AC 100% 52ms 91936KB
9 AC 100% 52ms 92656KB
10 AC 100% 51ms 93616KB
11 AC 100% 73ms 93952KB
12 AC 100% 56ms 92896KB
13 AC 100% 61ms 93552KB
14 AC 100% 67ms 93600KB
15 AC 100% 64ms 93232KB
16 AC 100% 60ms 92928KB
17 AC 100% 53ms 93568KB
18 AC 100% 59ms 92976KB
19 AC 100% 60ms 95744KB
20 AC 100% 72ms 95184KB
21 AC 100% 69ms 93376KB
22 AC 100% 67ms 94624KB
23 AC 100% 60ms 93552KB
24 AC 100% 79ms 97440KB
25 AC 100% 78ms 94576KB
26 AC 100% 78ms 96448KB
27 AC 100% 66ms 96608KB
28 AC 100% 72ms 96288KB
29 AC 100% 82ms 97680KB
30 AC 100% 75ms 95968KB

ソースコード

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 Main {
	static InputStream is;
	static PrintWriter out;
	static String INPUT = "";

	static void solve() {
		int n = ni();
		int[] t = na(n);
		int[][] a = new int[n][];
		for(int i = 0;i < n;i++){
			a[i] = na(n);
		}
		long ans = 0;
		for(int i = 0;i < n;i++){
			ans += t[i];
		}
		long[] dp = new long[1<<n];
		for(int i = 1;i < 1<<n;i++){
			for(int j = 0;j < n;j++){
				if(i<<~j<0){
					int c = 0;
					for(int k = 0;k < n;k++){
						if(i<<~k<0 && k != j){
							c -= a[k][j];
						}
					}
					dp[i] = Math.min(dp[i], dp[i^1<<j] + c);
				}
			}
		}
		out.println(ans + dp[(1<<n)-1]);
	}

	public static void main(String[] args) throws Exception {
		long S = System.currentTimeMillis();
		is = INPUT.isEmpty() ? System.in : new ByteArrayInputStream(INPUT.getBytes());
		out = new PrintWriter(System.out);

		solve();
		out.flush();
		long G = System.currentTimeMillis();
		tr(G - S + "ms");
	}

	private static boolean eof() {
		if (lenbuf == -1)
			return true;
		int lptr = ptrbuf;
		while (lptr < lenbuf)
			if (!isSpaceChar(inbuf[lptr++]))
				return false;

		try {
			is.mark(1000);
			while (true) {
				int b = is.read();
				if (b == -1) {
					is.reset();
					return true;
				} else if (!isSpaceChar(b)) {
					is.reset();
					return false;
				}
			}
		} catch (IOException e) {
			return true;
		}
	}

	private static byte[] inbuf = new byte[1024];
	public static int lenbuf = 0, ptrbuf = 0;

	private static 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 static boolean isSpaceChar(int c) {
		return !(c >= 33 && c <= 126);
	}

	private static int skip() {
		int b;
		while ((b = readByte()) != -1 && isSpaceChar(b))
			;
		return b;
	}

	private static double nd() {
		return Double.parseDouble(ns());
	}

	private static char nc() {
		return (char) skip();
	}

	private static 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 static 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 static 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 static int[] na(int n) {
		int[] a = new int[n];
		for (int i = 0; i < n; i++)
			a[i] = ni();
		return a;
	}

	private static int ni() {
		int num = 0, 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 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) {
		if (INPUT.length() != 0)
			System.out.println(Arrays.deepToString(o));
	}
}