Abandoned country

Time Limit: 8000/4000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)

Total Submission(s): 3449    Accepted Submission(s): 846

Problem DescriptionAn abandoned country has

n(n≤100000)villages which are numbered from 1 to n . Since abandoned for a long time, the roads need to be re-built. There are m(m≤1000000) roads to be re-built, the length of each road is wi(wi≤1000000) . Guaranteed that any two w are different. The roads made all the villages connected directly or indirectly before destroyed. Every road will cost the same value of its length to rebuild. The king wants to use the minimum cost to make all the villages connected with each other directly or indirectly. After the roads are re-built, the king asks a men as messenger. The king will select any two different points as starting point or the destination with the same probability. Now the king asks you to tell him the minimum cost and the minimum expectations length the messenger will walk.

 

 

InputThe first line contains an integer

T(T≤10) which indicates the number of test cases. 

For each test case, the first line contains two integers n,m indicate the number of villages and the number of roads to be re-built. Next m lines, each line have three number i,j,w , the length of a road connecting the village i and the village j is w .

 

 

Output

output the minimum cost and minimum Expectations with two decimal places. They separated by a space.

 

 

Sample Input

1

4 6

1 2 1

2 3 2

3 4 3

4 1 4

1 3 5

2 4 6

 

题意：求最小生成树，再求任意两点距离的期望。

最小生成树用kruscal。期望一开始不会求，看题解发现使用dfs：分别求每条边的贡献，一条边的贡献等于这条边的|左子树|*|右子树|*value。

 

代码中使用pair和vector

#include
     
      #include
      
       #include
       
        #include
        
         #include
         
          using namespace std;struct Path{    int x,y;    double value;} path[1000005];typedef pair
          
            P;vector 
           
 edge[1000005];bool cmp(Path a,Path b){ return a.value
          
         
        
       
      
     

 

Sample Output

6 3.33

 

 

Author

HIT

 

 

Source