

Shortestpath treeTime Limit: 6000/3000 MS (Java/Others) Memory Limit: 130712/130712 K (Java/Others)Total Submission(s): 2445 Accepted Submission(s): 833 Problem Description Given a connected, undirected graph G, a shortestpath tree rooted at vertex v is a spanning tree T of G, such that the path distance from root v to any other vertex u in T is the shortest path distance from v to u in G. We may construct a shortestpath tree using the following method: We consider a shortestpath tree rooted at node 1. For every node i in the graph G, we choose a shortest path from root to i. If there are many shortest paths from root to i, we choose the one that the sequence of passing nodes' number is lexicographically minimum. All edges on the paths that we chose form a shortestpath tree. Now we want to know how long are the longest simple paths which contain K nodes in the shortestpath tree and how many these paths? Two simple paths are different if the sets of nodes they go through are different. Input The first line has a number T (T <= 10), indicating the number of test cases. For each test case, the first line contains three integers n, m, k(1<=n<=30000,1<=m<=60000,2<=k<=n), denote the number of nodes, the number of edges and the nodes of required paths. Then next m lines, each lines contains three integers a, b, c(1<=a, b<=n, 1<=c<=10000),denote there is an edge between a, b and length is c. Output For each case, output two numbers, denote the length of required paths and the numbers of required paths. Sample Input
Sample Output
Author FZU Source Recommend  
