Editorial for DMOPC '15 Contest 4 P3 - Lethal


Remember to use this editorial only when stuck, and not to copy-paste code from it. Please be respectful to the problem author and editorialist.
Submitting an official solution before solving the problem yourself is a bannable offence.

Brute force. You can use bitmasks to iterate over all possible combinations where 0 is attacking the taunt minion and 1 is attacking the opponent, then check if there is sufficient attack power for each combination.

Time Complexity: \mathcal{O}(G \times 2^N)


Comments

There are no comments at the moment.