##### ###### ##### ### # # ### # # ###### ## ## ## ## ## ## ## # # # # # ## ##### #### ##### # # # # # # # #### ## # ## ## ## ## # # # # # ## ## # ###### ## ### # ### # ######
##### ###### ##### ### # # ### # # ###### ## ## ## ## ## ## ## # # # # # ## ##### #### ##### # # # # # # # #### ## # ## ## ## ## # # # # # ## ## # ###### ## ### # ### # ######
CSES 1686 - SCC and DP.
Problem: A game has rooms and one-way tunnels. Each room has coins. You start in any room and keep moving through tunnels, collecting coins. Find the maximum coins you can collect.
Link: CSES 1686
Constraints:
Hint: You can stay in a cycle collecting coins repeatedly. What does that tell you about SCCs?
