fzu_2087_统计树边

//先对边进行排序，把相同权值的分为一组
//然后根据贪心性质进行选择
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;

#define MAXN    100001
#define MAXM    100001

struct Edge {
        int u, v, w;
}edge[MAXM];

int root[MAXN];

int cmp(const struct Edge &a, const struct Edge &b)
{
        return a.w < b.w;
}

int get_root(int x)
{
        if( x == root[x] ) {
                return  x;
        }
        return root[x] = get_root(root[x]);
}

void update(int pre, int cur, int &ans)
{
        int rx, ry;
        for(int i = pre; i < cur; i ++) {
                rx = get_root(edge[i].u); ry = get_root(edge[i].v);
                if( rx != ry ) {
                        ans ++;
                }
        }
        for(int i = pre; i < cur; i ++) {
                rx = get_root(edge[i].u); ry = get_root(edge[i].v);
                if( rx != ry ) {
                        root[rx] = ry;
                }
        }
}

int krusal(int vertex, int arc)
{
        int ans(0), pre(0), cur(1);
        for(int i = 1; i <= vertex; i ++) {
                root[i] = i;
        }
        while( cur < arc ) {
                if( edge[cur].w != edge[pre].w ) {
                        update(pre, cur, ans); pre = cur;
                }
                cur ++;
        }
        update(pre, cur, ans);
        return ans;
}

int main(int argc, char const *argv[])
{
#ifndef ONLINE_JUDGE
        freopen("test.in", "r", stdin);
#endif
        int cas, vertex, arc;
        scanf("%d", &cas);
        while( cas -- ) {
                scanf("%d %d", &vertex, &arc);
                for(int i = 0; i < arc; i ++) {
                        scanf("%d %d %d", &edge[i].u, &edge[i].v, &edge[i].w);
                }
                sort(edge, edge+arc, cmp);
                printf("%d\n", krusal(vertex, arc));
        }
        return 0;
}