Problem - Coin Collector

Problem: A game has $n$ rooms and $m$ 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:

• $1 \leq n \leq 10^5$
• $1 \leq m \leq 2 \times 10^5$

Hint: You can stay in a cycle collecting coins repeatedly. What does that tell you about SCCs?