LeetCode [1595] Minimum Cost to Connect Two Groups of Points

 1595. Minimum Cost to Connect Two Groups of Points

Hard

You are given two groups of points where the first group has size1 points, the second group has size2 points, and size1 >= size2.

The cost of the connection between any two points are given in an size1 x size2 matrix where cost[i][j] is the cost of connecting point i of the first group and point j of the second group. The groups are connected if each point in both groups is connected to one or more points in the opposite group. In other words, each point in the first group must be connected to at least one point in the second group, and each point in the second group must be connected to at least one point in the first group.

Return the minimum cost it takes to connect the two groups.

 

Example 1:

Input: cost = [[15, 96], [36, 2]]
Output: 17
Explanation: The optimal way of connecting the groups is:
1--A
2--B
This results in a total cost of 17.

Example 2:

Input: cost = [[1, 3, 5], [4, 1, 1], [1, 5, 3]]
Output: 4
Explanation: The optimal way of connecting the groups is:
1--A
2--B
2--C
3--A
This results in a total cost of 4.
Note that there are multiple points connected to point 2 in the first group and point A in the second group. This does not matter as there is no limit to the number of points that can be connected. We only care about the minimum total cost.

Example 3:

Input: cost = [[2, 5, 1], [3, 4, 7], [8, 1, 2], [6, 2, 4], [3, 8, 8]]
Output: 10

 

Constraints:

• size1 == cost.length
• size2 == cost[i].length
• 1 <= size1, size2 <= 12
• size1 >= size2
• 0 <= cost[i][j] <= 100

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

class Solution { public int connectTwoGroups(List<List<Integer>> cs) { int m = cs.size(), n = cs.get(0).size(), msk = 1 << m, dp[] = new int[msk]; for (int i = 0; i < msk; i++) dp[i] = Integer.MAX_VALUE; dp[0] = 0; for (int i = 0; i < n; i++) { int[] tmp = new int[msk]; for (int l = 0; l < msk; l++) tmp[l] = Integer.MAX_VALUE; // tmp[0] = 0; // you can not leave the previous lines without connections. for (int k = 0; k < msk; k++) { for (int j = 0; j < m; j++) { int mask = k | (1 << j); //dp[k]: group1(k) <==> group2(0..i-1). connect i to 0..m-1 to find the minCost for covering i if (dp[k] != Integer.MAX_VALUE) tmp[mask] = Math.min(tmp[mask], dp[k] + cs.get(j).get(i)); //tmp[k]: group1(k) <==> group2(0..i) //updating tmp[mask] by connecting i to j if ((k & (1 << j)) == 0) { if (tmp[k] != Integer.MAX_VALUE) tmp[mask] = Math.min(tmp[mask], tmp[k] + cs.get(j).get(i)); } } } System.out.println(Arrays.toString(tmp)); dp = tmp; } return dp[msk - 1]; } }