Remmarguts' Date
Time Limit: 4000MS Memory Limit: 65536K
Total Submissions: 28497 Accepted: 7739
Description
"Good man never makes girls wait or breaks an appointment!" said the mandarin duck father. Softly touching his little ducks' head, he told them a story.
"Prince Remmarguts lives in his kingdom UDF – United Delta of Freedom. One day their neighboring country sent them Princess Uyuw on a diplomatic mission.""Erenow, the princess sent Remmarguts a letter, informing him that she would come to the hall and hold commercial talks with UDF if and only if the prince go and meet her via the K-th shortest path. (in fact, Uyuw does not want to come at all)"
Being interested inthe trade development and such a lovely girl, Prince Remmarguts really became enamored. He needs you - the prime minister's help!
DETAILS: UDF's capital consists of N stations. The hall is numbered S, whilethe station numbered T denotes prince' current place. M muddy directed sideways connect someofthe stations. Remmarguts' path to welcome the princess might include the same station twice or more than twice, even itisthe station withnumber S or T. Different paths with same length will be considered disparate.
Input
The first line contains two integer numbers N and M (1 <= N <= 1000, 0 <= M <= 100000). Stations are numbered from1to N. Each ofthe following M lines contains three integer numbers A, B and T (1 <= A, B <= N, 1 <= T <= 100). It shows that there is a directed sideway from A-th station to B-th station withtime T.
The last line consists of three integer numbers S, T and K (1 <= S, T <= N, 1 <= K <= 1000).
Output
A single line consisting of a single integernumber: thelength (time required) to welcome Princess Uyuw using the K-th shortest path. If K-th shortest path doesnot exist, you should output "-1" (without quotes) instead.
Sample Input
22125214122
Sample Output
14
Source
POJ Monthly,Zeyuan Zhu