Editorial for LCC ‘23 Contest 1 S2 - sdraC eht pilF


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.

Author: pingu

For <REDACTED> to be lying, at least one of the cards with the letter L must not have the number N on the back. Thus, Shane needs to flip all cards with the letter L facing up, and all cards that do not have the number N facing up. Note that a card with the number N but not the letter L will not indicate if <REDACTED> is lying.

Time Complexity: O(C)


Comments

There are no comments at the moment.