CF437D.The Child and Zoo

普及/提高-

通过率:0%

AC君温馨提醒

该题目为【codeforces】题库的题目,您提交的代码将被提交至codeforces进行远程评测,并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供,我们无法保证该服务的稳定性,若提交后无反应,请等待一段时间后再进行重试。

题目描述

Of course our child likes walking in a zoo. The zoo has nn areas, that are numbered from 11 to nn . The ii -th area contains aia_{i} animals in it. Also there are mm roads in the zoo, and each road connects two distinct areas. Naturally the zoo is connected, so you can reach any area of the zoo from any other area using the roads.

Our child is very smart. Imagine the child want to go from area pp to area qq . Firstly he considers all the simple routes from pp to qq . For each route the child writes down the number, that is equal to the minimum number of animals among the route areas. Let's denote the largest of the written numbers as f(p,q)f(p,q) . Finally, the child chooses one of the routes for which he writes down the value f(p,q)f(p,q) .

After the child has visited the zoo, he thinks about the question: what is the average value of f(p,q)f(p,q) for all pairs p,qp,q (pq)(p≠q) ? Can you answer his question?

输入格式

The first line contains two integers nn and mm ( 2<=n<=1052<=n<=10^{5} ; 0<=m<=1050<=m<=10^{5} ). The second line contains nn integers: a1,a2,...,ana_{1},a_{2},...,a_{n} ( 0<=ai<=1050<=a_{i}<=10^{5} ). Then follow mm lines, each line contains two integers xix_{i} and yiy_{i} ( 1<=xi,yi<=n1<=x_{i},y_{i}<=n ; xiyix_{i}≠y_{i} ), denoting the road between areas xix_{i} and yiy_{i} .

All roads are bidirectional, each pair of areas is connected by at most one road.

输出格式

Output a real number — the value of .

The answer will be considered correct if its relative or absolute error doesn't exceed 10410^{-4} .

输入输出样例

  • 输入#1

    4 3
    10 20 30 40
    1 3
    2 3
    4 3
    

    输出#1

    16.666667
    
  • 输入#2

    3 3
    10 20 30
    1 2
    2 3
    3 1
    

    输出#2

    13.333333
    
  • 输入#3

    7 8
    40 20 10 30 20 50 40
    1 2
    2 3
    3 4
    4 5
    5 6
    6 7
    1 4
    5 7
    

    输出#3

    18.571429
    

说明/提示

Consider the first sample. There are 1212 possible situations:

  • p=1,q=3,f(p,q)=10p=1,q=3,f(p,q)=10 .
  • p=2,q=3,f(p,q)=20p=2,q=3,f(p,q)=20 .
  • p=4,q=3,f(p,q)=30p=4,q=3,f(p,q)=30 .
  • p=1,q=2,f(p,q)=10p=1,q=2,f(p,q)=10 .
  • p=2,q=4,f(p,q)=20p=2,q=4,f(p,q)=20 .
  • p=4,q=1,f(p,q)=10p=4,q=1,f(p,q)=10 .

Another 66 cases are symmetrical to the above. The average is .

Consider the second sample. There are 66 possible situations:

  • p=1,q=2,f(p,q)=10p=1,q=2,f(p,q)=10 .
  • p=2,q=3,f(p,q)=20p=2,q=3,f(p,q)=20 .
  • p=1,q=3,f(p,q)=10p=1,q=3,f(p,q)=10 .

Another 33 cases are symmetrical to the above. The average is .

首页