shunfurh 于 2017.09.14 14:20 提问

Nonstop Travel

Description

Fast Phil works the late shift and leaves his company's parking lot at precisely 2:00 AM every morning. His route home is by a straight road which has one or more traffic signals. Phil has always wondered if, given the locations and cycles of each of the traffic signals, are there velocities he can travel home without ever having to speed up or slow down on account of a red light. You are to write a program to satisfy his curiosity.

Your program should find all integer speeds (in miles per hour) which can be used for Phil's trip home. Each speed is a rate (in miles per hour) he can maintain the moment he leaves the parking lot at 2:00 AM until he arrives home (we assume Phil has a long driveway in which to decelerate) such that he never passes through a red signal. He is allowed to pass throgh a signal at the exact moment it turns from yellow to red, or at the exact moment a red signal turns green. Since Phil is a relatively law-abiding citizen, you need only consider speeds less than or equal to 60 mph. Likewise, Phil isn't interested in travelling too slowly, so you should not consider speeds lower than 30 mph.
Input

Input will consist of one or more sets of data describing a set of traffic signals, followed by the integer -1. The first integer in each set will contain the value N (specifying the number of traffic signals). N will be no larger than 6. This value will be followed by N sets of numbers, each containing values (in order) for L, G, Y and R. L is a positive real number indicating the location of a traffic signal, in miles, from the parking lot. G, Y and R are the lengths of time (in seconds) of the green, yellow, and red periods of the corresponding traffic signal's cycle. Phil has learned from an informant in the Highway Department that all N traffic signals start their green period precisely at 2:00 AM.
Output

Output should consist of the input case number (starting with 1) followed by a list of all valid integer speeds Phil may drive to avoid the red signals. Consecutive integer speeds should be specified in interval notation of the form L-H, where L and H are the lowest and highest speeds for the interval. Intervals of the form L-L (that is, an interval of length 1) shold just be written as L. Intervals should be separated by commas. If there are no valid speeds, you program should display the phrase No acceptable speeds. The Expected Output below illustrates this format.
Sample Input

1
5.5 40 8 25

3
10.7 10 2 75
12.5 12 5 57
17.93 15 4 67

-1
Sample Output

Case 1: 30, 32-33, 36-38, 41-45, 48-54, 59-60
Case 2: No acceptable speeds.

1个回答

devmiao      2017.09.30 08:32

UVA 617 - Nonstop Travel

UVa617 - Nonstop Travel
Nonstop Travel  Fast Phil works the late shift and leaves his company's parking lot at precisely 2:00 AM every morning. His route home is by a straight road which has one or more traffic
POJ 1310 Nonstop Travel 笔记

UVA 617 - Nonstop Travel（数论+暴力枚举）

uva 617- Nonstop Travel(暴力+数学)

It's smarter to travel in group
It's smarter to travel in group.  有个动画的gif，很好玩的，不过太大了，上传不了。 留个链接吧，不知有效期多久哦。 团队的力量是很重要的。
1003. Universal Travel Sites (35)

[USACO Jan09]安全路径Safe Travel解题报告

UVALive 3561 Low Cost Air Travel（多状态最短路，dp）