CEMC Banner

Problem of the Week
Problem E
The Fantastic Race

As part of The Fantastic Race, teams need to travel on buses from city to city in the order Omicron to Pi to Rho to Sigma to Tau. Each city has several different bus stations to choose from. Nate has created the following map showing all the different bus routes between the five cities, as well as the travel time, in minutes, for each. The different bus stations within each city are labeled \(\text{A}\), \(\text{B}\), \(\text{C}\), etc.

An alternative format for the map can be found at the end of the problem.

Which route from Omicron to Tau gives the shortest total travel time?

This problem was inspired by a past Beaver Computing Challenge (BCC) problem.