CSES 1673 High Score - Problem Statement

You have $n$ rooms and $m$ tunnels with score values. You start at room $1$ and want to reach room $n$ with maximum total score. Some tunnels have negative scores. If you can loop through rooms infinitely to increase score, output $-1$. Otherwise, output the maximum score you can achieve on any path from room $1$ to room $n$.

This is a shortest path problem disguised as a maximum path problem. The twist is that you are maximizing score instead of minimizing cost, and you need to detect if infinite score is possible.