시간 제한 | 메모리 제한 | 제출 | 정답 | 맞힌 사람 | 정답 비율 |
---|---|---|---|---|---|
1 초 | 128 MB | 1 | 0 | 0 | 0.000% |
As a preliminary step in developing an autonomous vehicle system, your team is seeking to prove that a central traffic controller can sound an alert when automobiles are likely to collide unless corrective actions are taken.
The test course consists of a number of straight tracks that intersect at a variety of angles. As cars pass sensors mounted on the tracks, their position and speed is recorded and sent to the central controller. The controller remembers its two most recent sets of readings for each car.
There is some built-in uncertainty in this process. The readings provided by the sensors are not exact. Also, simple automated sensors can’t tell us what the drivers are thinking and whether they are already alert to the presence of other traffic. The controller can almost never state that a collision is unavoidable, and if it could make such a statement, it would probably not be able to do so in time for the drivers to take evasive action.
We therefore want the controller to sound the alert whenever two cars will pass“dangerously close” to one another any time within the next 30 seconds, assuming that they continue to behave as they have been recently observed to do. For this purpose, we will say that cars are dangerously close if they pass within 18 ft. of one another. Cars are considered safe if their closest approach is at least 20 ft. apart. A passage within 18. . . 20 ft. is considered ambiguous and may be treated either as dangerous or safe.
Assume that
If a car with initial speed s0 has constant acceleration a, then its speed at the end of a time interval t is
st =at+s0
Over that same time interval, the car would travel a distance
d = (a/2)t2 + ts0
The input may contain multiple data sets.
Each data set consists of 4 observations, one observation per line. The first two observations are for car 1, the second two are for car 2.
Each observation consists of four floating point numbers t, x, y, s, where
There will be no data sets in which the closest approach within the indicated timer interval falls in the ambiguous 18. . . 20 ft. range. The two observations for a given car will always occur at distinct times, and the first observation time for each car will be earlier than the second observation time for that car.
Input is terminated by an observation consisting of 4 negative numbers.
For each data set, print a single line consisting of either “Dangerous” or “Safe”, depending on whether a dangerously close passage is predicted to occur within 30 seconds following the maximum of the 4 observation times.
10 0 0 10 11 7.42 7.42 11 11 41.0 106.0 16 12 56 106 14 0 0 0 50 0.5 21.7 12.5 50.1 0.25 39.0 22.5 50 0.75 60.7 35.0 50.1 -1 -1 -1 -1
Dangerous Safe
ICPC > Regionals > North America > Mid-Atlantic Regional > 2012 Mid-Atlantic Regional Programming Contest C번
ICPC > Regionals > North America > Southeast USA Regional > 2012 Southeast USA Regional Programming Contest > Division 1 B번
ICPC > Regionals > North America > Southeast USA Regional > 2012 Southeast USA Regional Programming Contest > Division 2 B번