ZOJ 3708 Density of Power Network(图论)

水题啊  题目描述可怕

#include<iostream>
#include<cstdio>
#include<set>
#include<string>
#include<string.h>
#include<cstring>
#include<vector>
#include<map>
#include<queue>
#include<stack>
#include<cctype>
#include<algorithm>
#include<sstream>
#include<utility>
#define mt(a) memset(a,0,sizeof (a))
#define fl(a,b,c) fill(a,b,c)
#define SWAP(a,b,t) (t=a,a=b,b=t)

#define inf 1000000000+7

using namespace std;
typedef long long ll;
int n, m;
int graph[600][600];
int vis[600];
int s[600];
int en[600];
int visg[600][600];




int main()
{
	int T;
	cin >> T;
	while (T--)
	{
	
		cin >> n >> m;
		for (int i = 0; i < m; i++)
			scanf("%d", &s[i]);
		for (int i = 0; i < m; i++)
			scanf("%d", &en[i]);
		mt(graph);
		mt(vis);
		mt(visg);
		set<int>se;
		int lin = 0;
		for (int i = 0; i < m; i++)
		{
			se.insert(s[i]);
			se.insert(en[i]);
			if (!graph[s[i]][en[i]])
			{
				lin++;
				graph[s[i]][en[i]] = 1;
				graph[en[i]][s[i]] = 1;
			}
		}
		
		double ans = lin*1.0/n*1.0;
	
		printf("%.3lf\n",ans);
	}
	return 0;
}