ZOJ-3708-Density of Power Network【10th浙江省赛】

---

ZOJ-3708-Density of Power Network

---

The vast power system is the most complicated man-made system and the greatest engineering innovation in the 20th century. The following diagram shows a typical 14 bus power system. In real world, the power system may contains hundreds of buses and thousands of transmission lines.

Network topology analysis had long been a hot topic in the research of power system. And network density is one key index representing the robustness of power system. And you are asked to implement a procedure to calculate the network density of power system.

The network density is defined as the ratio between number of transmission lines and the number of buses. Please note that if two or more transmission lines connecting the same pair of buses, only one would be counted in the topology analysis.

Input

The first line contains a single integer T (T ≤ 1000), indicating there are T cases in total.

Each case begins with two integers N and M (2 ≤ N, M ≤ 500) in the first line, representing the number of buses and the number of transmission lines in the power system. Each Bus would be numbered from 1 to N.

The second line contains the list of start bus number of the transmission lines, separated by spaces.

The third line contains the list of corresponding end bus number of the transmission lines, separated by spaces. The end bus number of the transmission lines would not be the same as the start bus number.

Output

Output the network density of the power system in a single line, as defined in above. The answer should round to 3 digits after decimal point.

Sample Input
3
3 2
1 2
2 3
2 2
1 2
2 1
14 20
2 5 3 4 5 4 5 7 9 6 11 12 13 8 9 10 14 11 13 13
1 1 2 2 2 3 4 4 4 5 6 6 6 7 7 9 9 10 12 14

Sample Output
0.667
0.500
1.429

题目链接：ZOJ-3708

题目大意：给出一个数n表示有n个点，给出一个数m表示有m条边，边是无向边， 给出的边中可能存在平行边，问去除平行边后的边数与点数的比值

以下是代码：

#include<iostream>
#include<cstdio>
#include<vector>
using namespace std;
int main(){
    int t;
    cin >> t;
    while(t--)
    {
        int n,m;
        cin >> n >>m;
        int a[2000];
        int b[2000];
        for (int i = 0; i < m; i++){
            cin >> a[i];
        }
        for (int i = 0; i < m; i++){
            cin >> b[i];
        }
        int cnt = 0;
        for (int i = 0; i < m - 1; i++){
            for (int j = i + 1; j < m; j++){
                if (a[i] == b[j] && b[i] == a[j] && i != j)
                {
                    cnt++;
                    break;
                }
                else if(a[i] == a[j] && b[i] == b[j] && i != j)
                {
                    cnt++;
                    break;
                }
            }
        }
        double ans;
        if (cnt == 0)
            ans = m * 1.0 / n ;
        else
            ans = (m - cnt) * 1.0 / n ;
        printf("%.3f\n",ans);
    }
    return 0;
}