Assignment cost
There are n workers and n tasks. cost[i][j] is the cost of assigning worker i to task j. Each worker does exactly one task and each task is done by exactly one worker. Return the minimum total assignment cost. Use bitmask DP over which tasks are taken. Constraints: 1 <= n <= 14, 0 <= cost[i][j] <= 1000.
Implement
min_assignment(cost: list[list[int]]) → intExamples
in
[[[9,2,7],[6,4,3],[5,8,1]]]out9What a strong answer looks like
State your approach and its time/space complexity out loud before you optimize. Handle the edge cases (empty input, duplicates, overflow), and say why you chose this over the brute force. Green tests are the floor, not the grade.
0:00 of about 30 min
solution.py
InputExpectedGot
[[[9,2,7],[6,4,3],[5,8,1]]]9not run yetsample