题目描述
Robot Timmy has packages to deliver. Help Timmy find the shortest path he can use to travel to deliver his package.
Because he is a robot, Timmy the area he has to travel in as a series of numbered points (maximum 150), and aclculations of the distance between pairs of these points.
The inputs to the program are as follows:
The first line will contain a pair of integer values a & b, where a represents the number of the point Timmy will be leaving from and b represents the number of the point timmy will be travelling to.
The second line will contain the number of points N (N <= 150). Points are numbered 0 to N - 1.
The third line will contain the number of connections between these points E (E <= 2500)
All of the remaining E lines will contain three values, two points with indexes i&j and the distance k between them (These pairs of points can be travelled in both directions)
Because he is a robot, Timmy the area he has to travel in as a series of numbered points (maximum 150), and aclculations of the distance between pairs of these points.
The inputs to the program are as follows:
The first line will contain a pair of integer values a & b, where a represents the number of the point Timmy will be leaving from and b represents the number of the point timmy will be travelling to.
The second line will contain the number of points N (N <= 150). Points are numbered 0 to N - 1.
The third line will contain the number of connections between these points E (E <= 2500)
All of the remaining E lines will contain three values, two points with indexes i&j and the distance k between them (These pairs of points can be travelled in both directions)
输入格式
Several lines of figures
First line you should input two number a and b (0<=a<=b<=N)
Second line you should input a single number N (N<=150)
Third line you should input a single number E (E<=2500)
then there will be several lines to enter the distance between two points with the order of i, j, k (i<=j)
First line you should input two number a and b (0<=a<=b<=N)
Second line you should input a single number N (N<=150)
Third line you should input a single number E (E<=2500)
then there will be several lines to enter the distance between two points with the order of i, j, k (i<=j)
输出格式
The shortest route and the total distance of this route
样例输入
0 5 10 23 0 2 2 0 3 2 0 6 10 0 7 2 0 8 4 1 3 9 1 4 4 1 5 3 1 8 2 2 5 8 2 7 7 2 8 3 3 4 10 3 5 8 3 6 4 3 9 9 4 6 6 4 8 5 4 9 10 5 6 8 5 8 8 6 7 6 7 9 9
样例输出
0 - 8 - 1 - 5 Total distance: 9