LeetCode 1029 Two City Scheduling (dp)

A company is planning to interview 2n people. Given the array costs where costs[i] = [aCosti, bCosti], the cost of flying the ith person to city a is aCosti, and the cost of flying the ith person to city b is bCosti.

Return the minimum cost to fly every person to a city such that exactly n people arrive in each city.

Example 1:

Input: costs = [[10,20],[30,200],[400,50],[30,20]]
Output: 110
Explanation: 
The first person goes to city A for a cost of 10.
The second person goes to city A for a cost of 30.
The third person goes to city B for a cost of 50.
The fourth person goes to city B for a cost of 20.

The total minimum cost is 10 + 30 + 50 + 20 = 110 to have half the people interviewing in each city.

Example 2:

Input: costs = [[259,770],[448,54],[926,667],[184,139],[840,118],[577,469]]
Output: 1859

Example 3:

Input: costs = [[515,563],[451,713],[537,709],[343,819],[855,779],[457,60],[650,359],[631,42]]
Output: 3086

Constraints:

• 2 * n == costs.length
• 2 <= costs.length <= 100
• costs.length is even.
• 1 <= aCosti, bCosti <= 1000

题目链接：https://leetcode.com/problems/two-city-scheduling/

题目大意：有2n个人，每个人去城市A和B分别有个cost，求让每个城市各有n个人去的最小总cost

题目分析：看到数据范围很容易想到一个n^3的dp，dp[i][a][b]表示到第i个人，在必选第i个人的情况下去了A城市a个人，去了B城市b个人的最小总花费，易得转移方程：

dp[i][a][b] = min(dp[i - 1][a - 1][b] + cost[i][0], dp[i - 1][a][b - 1] + cost[i][1])

因为dp方程决定了每个i都至少会选一个城市，故可省去一维空间

18ms，时间击败5%

class Solution {
    public int twoCitySchedCost(int[][] costs) {
        int n = costs.length, m = n >> 1;
        int[][] dp = new int[n + 1][m + 1];
        for (int i = 1; i <= n; i++) {
            for (int a = 0; a <= m; a++) {
                for (int b = 0; b <= m; b++) {
                    if (a == 0 && b == 0) {
                        continue;
                    }
                    if (a + b <= i) {
                        if (a == 0) {
                            dp[i][a] = dp[i - 1][a] + costs[i - 1][1];
                        } else if (b == 0) {
                            dp[i][a] = dp[i - 1][a - 1] + costs[i - 1][0];
                        } else {
                            dp[i][a] = Math.min(dp[i - 1][a - 1] + costs[i - 1][0], dp[i - 1][a] + costs[i - 1][1]);
                        }
                        // System.out.println("dp["+i+"]["+a+"]["+b+"] = " + dp[i][a]);
                    }
                }
            }
        }
        return dp[n][m];
    }
}