HDU 5723 - Abandoned country（最小生成树+dfs）

/*  https://vjudge.net/problem/HDU-5723

题意：给定N个顶点M条边的无向图，每条边包含一个权值，权值都各不相同，
    求最小生成树,并求最小生成树上的任意两点之间距离的最小期望。

因为边权值各不相同，那么最小生成树是唯一的。
那么只需要求最小生成树上的任意两点之间的距离之和除以N*(N-1)/2即可。

先用Kruskal生成最小树，然后数每一条边通过几次，
    每条边通过的次数乘以权重的累加和再除以C(n,2)即为最小期望
求通过次数的方法就是 当前边把全部点分成两部分，假设一部分点数为t,
    则通过次数就为 t*(n-t)
看这里面的图  http://blog.csdn.net/eventqueue/article/details/51966006

同hdu 2376
*/

#include <iostream>
#include <algorithm>
#include <cstdio>
#include <cstring>
#include <queue>
#include <vector>
#include <cmath>
#include <stack>
#include <string>
#include <sstream>
#include <map>
#include <set>
#define pi acos(-1.0)
#define LL long long
#define ULL unsigned long long
#define inf 0x3f3f3f3f
#define INF 1e18
#define lson l,mid,rt<<1
#define rson mid+1,r,rt<<1|1
using namespace std;
typedef pair<int, int> P;
const double eps = 1e-10;
const int maxn = 1e6 + 5;
const int N = 1e4 + 5;
const int mod = 1e8;

struct Road{
    int u, v, w;
    bool operator < (const Road& a) const{
        return w < a.w;
    }
}road[maxn];
struct edge{
    int v, w;
    edge(int v_, int w_):v(v_), w(w_){}
};
int n, m;
int ret[maxn], vis[maxn];
vector<edge>G[maxn];
LL res, sum;

int find(int a)
{
    if (ret[a] == -1) return a;
    return ret[a] = find(ret[a]);
}
void Kruskal()
{
    sort(road+1, road+1+m);
    memset(ret, -1, sizeof(ret));
    sum = 0;
    int cnt = 0;
    for (int i = 1; i <= m; i++){
        int x = find(road[i].u);
        int y = find(road[i].v);
        if (x == y) continue;
        ret[x] = y;
        sum += road[i].w;
        G[road[i].u].push_back(edge(road[i].v, road[i].w));
        G[road[i].v].push_back(edge(road[i].u, road[i].w));
        cnt++;
        if (cnt == n-1) break;
    }
}
LL dfs(int u)
{
    vis[u] = 1;
    LL cnt = 1;
    for (int i = 0; i < G[u].size(); i++){
        edge e = G[u][i];
        if (vis[e.v]) continue;
        LL tmp = dfs(e.v);
        res += tmp * (n - tmp) * e.w;
        cnt += tmp;
    }
    return cnt;
}
int main(void)
{
//	freopen("in.txt","r", stdin);
    int T;
    cin >> T;
    while (T--){
        cin >> n >> m;
        for (int i = 1; i <= m; i++)
            scanf("%d %d %d", &road[i].u, &road[i].v, &road[i].w);
        for (int i = 1; i <= n; i++)
            G[i].clear();
        Kruskal();
        res = 0;
        memset(vis, 0, sizeof(vis));
        dfs(1);
        double exc = (res * 1.0 / (1.0*n*(n-1)/2));
        printf("%I64d %.2f\n", sum, exc);
    }

	return 0;
}