Pattern recognition:
- One-way tunnels = directed graph
- Can traverse cycles = all coins in an SCC are collectible together
- Maximize collection = find optimal path in DAG
Approach: Find SCCs and condense the graph
Each super-node has sum of coins from all its rooms
The condensed graph is a DAG
Run DP to find maximum coins on any path
This is SCC + DP on DAG, a classic combination.