Online Judge | Problem Set | Authors | Online Contests | User | ||||||
---|---|---|---|---|---|---|---|---|---|---|

Web Board Home Page F.A.Qs Statistical Charts | Current Contest Past Contests Scheduled Contests Award Contest |

Language: Sightseeing
Description Tour operator Your Personal Holiday organises guided bus trips across the Benelux. Every day the bus moves from one city Different groups of tourists may have different preferences for the sights they want to see, and thus for the route to be taken from There is a restriction on the routes that the tourists may choose from. To leave enough time for the sightseeing at the stops (and to avoid using too much fuel), the bus has to take a short route from For example, for the above road map, there are two minimal routes from Now, given a (partial) road map of the Benelux and two cities Input The first line of the input file contains a single number: the number of test cases to follow. Each test case has the following format: One line with two integers *N*and*M*, separated by a single space, with 2 ≤*N*≤ 1,000 and 1 ≤*M*≤ 10, 000: the number of cities and the number of roads in the road map.*M*lines, each with three integers*A*,*B*and*L*, separated by single spaces, with 1 ≤*A*,*B*≤*N*,*A*≠*B*and 1 ≤*L*≤ 1,000, describing a road from city*A*to city*B*with length*L*.The roads are unidirectional. Hence, if there is a road from *A*to*B*, then there is not necessarily also a road from*B*to*A*. There may be different roads from a city*A*to a city*B*.One line with two integers *S*and*F*, separated by a single space, with 1 ≤*S*,*F*≤*N*and*S*≠*F*: the starting city and the final city of the route.There will be at least one route from *S*to*F*.
Output For every test case in the input file, the output should contain a single number, on a single line: the number of routes of minimal length or one distance unit longer. Test cases are such, that this number is at most 10 Sample Input 2 5 8 1 2 3 1 3 2 1 4 5 2 3 1 2 5 3 3 4 2 3 5 4 4 5 3 1 5 5 6 2 3 1 3 2 1 3 1 10 4 5 2 5 2 7 5 2 7 4 1 Sample Output 3 2 Hint The first test case above corresponds to the picture in the problem description. Source |

[Submit] [Go Back] [Status] [Discuss]

All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di

Any problem, Please Contact Administrator