/
BOJ_1311.java
44 lines (34 loc) · 1.27 KB
/
BOJ_1311.java
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.util.Arrays;
import java.util.StringTokenizer;
public class Main {
static BufferedReader br = new BufferedReader(new InputStreamReader(System.in), 1<<16);
static final int INF = 20*10000+1;
public static void main(String[] args) throws Exception {
new Main().solution();
}
private void solution() throws Exception {
int n = Integer.parseInt(br.readLine());
int[][] arr = new int[n+1][n+1];
for (int i = 1; i <= n; i++) {
StringTokenizer st = new StringTokenizer(br.readLine());
for (int j = 1; j <= n; j++) {
arr[i][j] = Integer.parseInt(st.nextToken());
}
}
int[][] dp = new int[n+1][1<<(n+1)];
for (int[] row : dp) Arrays.fill(row, INF);
dp[0][0] = 0;
for (int i = 1; i <= n; i++) {
for (int j = 0; j < 1<<(n+1); j++) {
if (dp[i-1][j] == INF) continue;
for (int k = 1; k <= n; k++) {
if ((j&(1<<k)) != 0) continue;
dp[i][j|(1<<k)] = Math.min(dp[i][j|(1<<k)], dp[i-1][j] + arr[i][k]);
}
}
}
System.out.println(dp[n][(1<<(n+1))-2]);
}
}