Perfect Assignment — Solution & Editorial

Back to the Problem

Bitmask DP over assigned tasks: dp[mask] = min cost to assign the first popcount(mask) workers to the tasks in mask. (Hungarian algorithm scales to N = 500, but bitmask is enough here.)

Complexity: O(2^N · N)