2017年11月1日提高组T2 树论

Description

---

Input

---

Hint

---

Solution

---

水

按边排序，枚举一条最短边做最小生成树，这样就保证了最短边不同时最长边尽可能小

Code

---

#include <stdio.h>
#include <string.h>
#include <math.h>
#include <iostream>
#include <queue>
#include <vector>
#include <algorithm>
#define rep(i, st, ed) for (int i = st; i <= ed; i += 1)
#define drp(i, st, ed) for (int i = st; i >= ed; i -= 1)
#define erg(i, st) for (int i = ls[st]; i; i = e[i].next)
#define fill(x, t) memset(x, t, sizeof(x))
#define min(x, y) ((x)<(y)?(x):(y))
#define max(x, y) ((x)>(y)?(x):(y))
#define ld long double
#define db double
#define ll long long
#define INF 0x3f3f3f3f
#define N 4021
#define E 16021
#define L 1001
struct edge {int x, y, w, next;} e[E];
int fa[N];
int edgeCnt;
inline int read() {
    int x = 0, v = 1;
    char ch = getchar();
    for (; ch < '0' || ch > '9'; v *= (ch == '-')?(-1):(1), ch = getchar());
    for (; ch <= '9' && ch >= '0'; (x *= 10) += ch - '0', ch = getchar());
    return x * v;
}
inline void addEdge(int x, int y, int w) {
    e[++ edgeCnt] = (edge) {x, y, w};
}
inline int getFather(int now) {
    return (!(fa[now]))?(now):(fa[now] = getFather(fa[now]));
}
inline bool cmp(edge a, edge b) {
    return a.w < b.w;
}
inline bool merge(int x, int y) {
    x = getFather(x);
    y = getFather(y);
    if (x == y) {
        return 0;
    }
    fa[x] = y;
    return 1;
}
inline int buildTree(int st, int n) {
    fill(fa, 0);
    int mx = 0;
    int cnt = 0;
    rep(i, st, edgeCnt) {
        if (merge(e[i].x, e[i].y)) {
            mx = e[i].w;
            cnt += 1;
        }
    }
    if (cnt != n - 1) {
        return INF;
    }
    return mx - e[st].w;
}
int main(void) {
    int T = read();
    while (T --) {
        edgeCnt = 0;
        int n = read();
        int m = read();
        rep(i, 1, m) {
            int x = read();
            int y = read();
            int w = read();
            addEdge(x, y, w);
        }
        std:: sort(e + 1, e + edgeCnt + 1, cmp);
        int ans = INF;
        rep(i, 1, edgeCnt) {
            int ret = buildTree(i, n);
            ans = min(ans, ret);
        }
        if (ans == INF) {
            ans = -1;
        }
        printf("%d\n", ans);
    }
    return 0;
}