Caocao's Bridges

题目

Caocao was defeated by Zhuge Liang and Zhou Yu in the battle of Chibi. But he wouldn't give up. Caocao's army still was not good at water battles, so he came up with another idea. He built many islands in the Changjiang river, and based on those islands, Caocao's army could easily attack Zhou Yu's troop. Caocao also built bridges connecting islands. If all islands were connected by bridges, Caocao's army could be deployed very conveniently among those islands. Zhou Yu couldn't stand with that, so he wanted to destroy some Caocao's bridges so one or more islands would be seperated from other islands. But Zhou Yu had only one bomb which was left by Zhuge Liang, so he could only destroy one bridge. Zhou Yu must send someone carrying the bomb to destroy the bridge. There might be guards on bridges. The soldier number of the bombing team couldn't be less than the guard number of a bridge, or the mission would fail. Please figure out as least how many soldiers Zhou Yu have to sent to complete the island seperating mission.

Input

There are no more than 12 test cases. 

In each test case: 

The first line contains two integers, N and M, meaning that there are N islands and M bridges. All the islands are numbered from 1 to N. ( 2 <= N <= 1000, 0 < M <= N 2) 

Next M lines describes M bridges. Each line contains three integers U,V and W, meaning that there is a bridge connecting island U and island V, and there are W guards on that bridge. ( U ≠ V and 0 <= W <= 10,000 ) 

The input ends with N = 0 and M = 0.

Output

For each test case, print the minimum soldier number Zhou Yu had to send to complete the mission. If Zhou Yu couldn't succeed any way, print -1 instead.

样例

这是一道双连通图求桥的权值问题，其实套个模板就好了

#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <cmath>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <vector>
#include <string.h>
#define INF 0x3f3f3f3f
#define mem(a,b) memset(a,b,sizeof(a))
#define _for1(i,a,b) for( int i=(a); i<(b); ++i)
#define _for2(i,a,b) for( int i=(a); i>(b); i--)
#define _rep1(i,a,b) for( int i=(a); i<=(b); ++i)
#define _rep2(i,a,b) for( int i=(a); i>=(b); i--)
typedef long long ll;
using namespace std;
#define maxn 1010
#define maxm 1000100
int n, m;
int low[maxn];
int dfn[maxn];
int head[maxn], cnt;
int tclock;
int mark;//判断图是否连通

struct node {
	int u, v, w, cnt, next;
};
node edge[maxm];

void tarjin(int u, int gen) {
	low[u] = dfn[u] = ++tclock;
	int flag = 1;
	for (int i = head[u]; i != -1; i = edge[i].next) {
		int v = edge[i].v;
		if (flag && v == gen) {
			flag = 0;
			continue;
		}
		if (!dfn[v]) {
			tarjin(v, u);
			low[u] = min(low[u], low[v]);
			if (dfn[u] < low[v])
				edge[i].cnt = edge[i ^ 1].cnt = 1;
		}
		else
			low[u] = min(low[u], dfn[v]);
	}
}

int main() {
	while (scanf("%d%d", &n, &m), n + m) {
		cnt = 0;
		mem(head, -1);
		while (m--) {
			int u, v, w;
			scanf("%d%d%d", &u, &v, &w);
			edge[cnt] = { u, v, w, 0, head[u] };
			head[u] = cnt++;
			edge[cnt] = { v, u, w, 0, head[v] };
			head[v] = cnt++;
		}
		mem(dfn, 0), mem(low, 0);
		tclock = 0;
		tarjin(1, 1);
		mark = 1;
		_rep1(i, 1, n) {
			if (!dfn[i]) {
				mark = 0;
				break;
			}
		}
		if (!mark)
			printf("0\n");
		else {
			int ans = INF;
			_for1(i, 0, cnt) {
				if (edge[i].cnt)
					ans = min(ans, edge[i].w);
			}
			if (ans == INF)
				ans = -1;
			if (ans == 0)
				ans = 1;
			printf("%d\n", ans);
		}
	}
	return 0;
}