I've been trying https://open.kattis.com/contests/nar21practice7/problems/pictureday for a while and haven't found a time-efficient solution. The problem is a variation of the NP-complete minimum weighted set cover problem. Any approaches or ideas are appreciated!
Auto comment: topic has been updated by BigNerd24 (previous revision, new revision, compare).