There are 10 horizontal roads and 10 vertical roads in a city, and they intersect at 100 crossings. Bob drives from one crossing, passes every crossing exactly once, and return to the original crossing. At every crossing, there is no wait to turn right, 1 minute wait to go straight, and 2 minutes wait to turn left. Let be the minimum number of total minutes on waiting at the crossings, then .
Solution
Obviously, the route of driving is a non-self-intersecting closed polyline. Regard each crossing as a vertex, then the route is regarded as a 100-gon.An interior angle may be greater than or equal to a straight angle.. By the formula of the sum of the angles of the polygon, the sum of all interior angles is . Note that the interior angle can only be or , if there are angles of angles of , then , so . If Bob drives clockwise, then and corrsponds to turn right, go straight and turn left, respectively. The total time on waiting at the crossings is min ; If Bob drives clockwise, then and corrsponds to turn left, go straight and turn right, respectively. The total time on waiting at the crossings is . Therefore, , and (C) is correct. Note: If we ignore the waiting time on the beginning/ending crossing, the total time on waiting can be decreased by 2 minutes (Bob can choose a left-turn crossing as the beginning), we have that , but do not affect the correct choice.