大水题
给定公交车的数量n,和路线数m,路线的起点和终点,求路线与车辆数之比( i->j 和 j->i 为同一路线)
#include <stdio.h>
#include <algorithm>
#include <iostream>
#include <string.h>
#include <stdlib.h>
#include <queue>
#include <vector>
#include <math.h>
#include <stack>
#include <map>
#define rtl rt<<1
#define rtr rt<<1|1
typedef long long LL;
using namespace std;
const int MAX = 500+10;
const double eps = 1e-10;
const double PI = acos(-1.0);
int n, m, a[MAX], b[MAX], t, maps[MAX][MAX];
int main()
{
scanf("%d", &t);
while(t--)
{
scanf("%d%d", &n, &m);
for(int i = 1; i<=m; ++i)
cin>>a[i];
for(int i = 1; i<=m; ++i)
cin>>b[i];
int ans = 0;
memset(maps, 0, sizeof(maps));
for(int i = 1; i<=m; ++i)
{
if(!maps[a[i]][b[i]])
ans++;
maps[a[i]][b[i]] = maps[b[i]][a[i]] = 1;
}
printf("%.3f\n", 1.0*ans/n);
}
return 0;
}