HDU 4738 Caocao‘s Bridges （桥+特判连通）

题意：给出一张无向图，求最小权的桥。

题解：桥
跑tarjan求桥。

特判要注意两个点：
①若本身不连通，输出0
②若最小权为0，输出1

#define _CRT_SECURE_NO_WARNINGS
#include<iostream>
#include<cstdio>
#include<string>
#include<cstring>
#include<algorithm>
#include<queue>
#include<stack>
#include<cmath>
#include<vector>
#include<fstream>
#include<set>
#include<map>
#include<sstream>
#include<iomanip>
#define ll long long
using namespace std;
/*
 * 求无向图的割点和桥
 * 可以找出割点和桥，求删掉每个点后增加的连通块。
 * 需要注意重边的处理，可以先用矩阵存，再转邻接表，或者进行判重
 */
const int MAXN = 1010;
const int MAXM = 2000010;
struct Edge {
    int to, next, w;
    bool cut;//是否为桥的标记
}edge[MAXM];
int head[MAXN], tot;
int Low[MAXN], DFN[MAXN];
int Index;
int bridge;
void addedge(int u, int v, int w) {
    edge[tot].to = v; edge[tot].next = head[u]; edge[tot].cut = false;
    edge[tot].w = w;
    head[u] = tot++;
}
void Tarjan(int u, int pre) {
    int v;
    Low[u] = DFN[u] = ++Index;
    int son = 0;
    int pre_cnt = 0; //处理重边，如果不需要可以去掉
    for (int i = head[u]; ~i; i = edge[i].next) {
        v = edge[i].to;
        if (v == pre && pre_cnt == 0) { pre_cnt++; continue; }
        if (!DFN[v]) {
            son++;
            Tarjan(v, u);
            if (Low[u] > Low[v]) Low[u] = Low[v];
            //桥
            //一条无向边 (u,v) 是桥，当且仅当 (u,v) 为树枝边，且满足DFS(u) < Low(v)。
            if (Low[v] > DFN[u]) {
                bridge++;
                edge[i].cut = true;
                edge[i ^ 1].cut = true;
            }
        }
        else if (Low[u] > DFN[v])
            Low[u] = DFN[v];
    }
}
int cnt;
void solve(int N) {
    memset(DFN, 0, sizeof(DFN));
    Index = 0;
    bridge = 0;
    for (int i = 1; i <= N; i++)
        if (!DFN[i]) Tarjan(i, i), cnt++;
}
void init() {
    tot = 0;
    memset(head, -1, sizeof(head));
}
int n, m, u, v, w;
int main() {
	while (scanf("%d%d", &n, &m) && n) {
        init();
        cnt = 0;
		for (int i = 1; i <= m; i++) {
			scanf("%d%d%d", &u, &v, &w);
            addedge(u, v, w);
            addedge(v, u, w);
		}
        solve(n);
        int ans = 0x3f3f3f3f;
        for (int i = 1; i <= n; i++) {
            for (int j = head[i]; ~j; j = edge[j].next) {
                int v = edge[j].to;
                int w = edge[j].w;
                if (edge[j].cut) {
                    ans = min(ans, edge[j].w);
                }
            }
        }
        if (cnt > 1) puts("0");
        else printf("%d\n", bridge == 0 ? -1 : (ans == 0 ? 1 : ans));
	}
	return 0;
}