1. Build a graph with M + 2 nodes: one for each obstacle and one for each of the top and bottom walls.
2. Add an edge between obstacles if they overlap.
3. Check if the top wall is connected to the bottom wall using depth-first search (connected means no path)

First Solve: CTF_505