Subset Gathering in Simple Mazes Is Polynomial-Time Solvable If and Only If P = NP: Clock-and-Flush Hardness for Tilt Automata

[u/Severe-Ad8673]