##### ###### ##### ### # # ### # # ###### ## ## ## ## ## ## ## # # # # # ## ##### #### ##### # # # # # # # #### ## # ## ## ## ## # # # # # ## ## # ###### ## ### # ### # ######
##### ###### ##### ### # # ### # # ###### ## ## ## ## ## ## ## # # # # # ## ##### #### ##### # # # # # # # #### ## # ## ## ## ## # # # # # ## ## # ###### ## ### # ### # ######
CSES 1684 - 2-SAT.
Problem: people are choosing toppings for a pizza. Each person specifies two topping preferences with conditions like "I want topping " or "I don't want topping ". Each person must get at least one of their wishes. Can you satisfy everyone?
Link: CSES 1684
Constraints:
Output: A valid topping selection, or "IMPOSSIBLE".
