|시간 제한||메모리 제한||제출||정답||맞은 사람||정답 비율|
|1 초||128 MB||1||1||1||100.000%|
In our busy world, we are not usually interested in taking the shortest path, but rather the path that takes the shortest time. When driving a car, this means that the speed limits on different roads are crucial. Imagine now that some speed limit signs are missing. Since you cannot expect the driver to know speed limits by heart, the only reasonable conclusion is that whatever speed limit he/she obeyed before will still hold after passing a missing sign. You are to write a program that calculates the fastest path by taking advantage of the missing signs.
You are given a description of the road network in a highly motorized area. To make things easier the network consists of crossings and roads. Every road is one-way, connects exactly two crossings and has at most one speed limit sign, located in the beginning of the road. For any two crossings A and B, there exists at most one road from A to B. You may assume that acceleration is instantaneous and that no other traffic will affect you. And of course you never drive faster than the current speed limit.
The first line of the input consists of three integers N, M and D, where N (2 ≤ N ≤ 150) is the number of crossings numbered from 0 to N-1, M is the number of roads and D is the label of the crossing that is your destination. Each of the following M lines of the input file describes one road. Every line consists of four integers A (0 ≤ A < N), B (0 ≤ B < N), V (0 ≤ V ≤ 500) and L (1 ≤ L ≤ 500), signifying that the road goes from the crossing labelled by A to crossing B, has speed limit V and length L. If V is zero, this means that the speed limit sign is missing. The time T taken for a given road is thus T = L / V if V ≠ 0, otherwise T = L / Vold, where Vold is the speed limit you obeyed before you arrived at the crossing. Note that the division should be done with floating-point numbers to avoid unnecessary rounding. In the beginning you are at crossing 0 and your current speed is 70.
The output must consist of one single line of integers, describing the crossings you pass on the fastest possible path from 0 to D. The crossings should be written in the exact order in which you pass them, starting with 0 and ending with D. There will never be two fastest paths taking the same time.
6 15 1 0 1 25 68 0 2 30 50 0 5 0 101 1 2 70 77 1 3 35 42 2 0 0 22 2 1 40 86 2 3 0 23 2 4 45 40 3 1 64 14 3 5 0 23 4 1 95 8 5 1 0 84 5 2 90 64 5 3 36 40
0 5 2 3 1
The required time is in this case 2,628 units.