How Many PathsAre There
TimeLimit: 2000/1000 MS (Java/Others) Memory Limit:32768/32768 K (Java/Others)
Total Submission(s): 1820 Accepted Submission(s): 646
oooccc1 is a Software Engineerwho has to ride to the work place every Monday through Friday. For a longperiod, he went to office with the shortest path because he loves to sleeplate…Time goes by, he find that he should have some changes as you could see,always riding with the same path is boring.
One day, oooccc1 got an idea! Why could I take another path? Tiredat all the tasks he got, he got no time to carry it out. As a best friend ofhis, you’re going to help him!
Since oooccc1 is now getting up earlier, he is glad to take thosepaths, which are a little longer than the shortest one. To be precisely, youare going to find all the second shortest paths.
You would be given a directed graph G, together with the startpoint S which stands for oooccc’1 his house and target point E presents hisoffice. And there is no cycle in the graph. Your task is to tell him how longare these paths and how many there are.
There are some cases. Proceed till the endof file.
The first line of each case is three integers N, M, S, E (3 <= N <= 50, 0<= S , E <N)
N stands for the nodes in that graph, M stands for the number of edges, Sstands for the start point, and E stands for the end point.
Then M lines follows to describe the edges: x y w. x stands for the startpoint, and y stands for another point, w stands for the length between x and y.
All the nodes are marked from 0 to N-1.
For each case,please output the length andcount for those second shortest paths in one line. Separate them with a singlespace.
3 3 0 2
0 2 5
0 1 4
1 2 2
HDU2009-12 Programming Contest