HDU 4738 Caocao's Bridges 有重边的无向图求桥

Caocao’s Bridges

Description

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.

Sample Input

3 3
1 2 7
2 3 4
3 1 4
3 2
1 2 7
2 3 4
0 0

Sample Output

-1
4

题意：给你一个无向图，每条边上有一个权值。如果这个图不连通，输出0，否则输出所有的桥中最小的权值，（如果最小的权值是0，输出1），如果不存在桥，输出-1；

题解：
几点注意：
1.（原题是权值代表曹操派了多少人守桥，而刘备要派人炸桥）所以即使桥上没有人，也要派一个人。
2.有重边。【本来我是想学下如果用前向星怎么处理重边，最后还是用了邻接矩阵……

大概是在水题的道路上越走越远了。

#include<cstdio>
#include<cstring>
#include<algorithm>
#include<iostream>
using namespace std;

inline int read(){
    int x=0,f=1;char ch=getchar();
    while(ch<'0'||ch>'9') {if(ch=='-') f=-1;ch=getchar();}
    while(ch>='0'&&ch<='9') {x=x*10+ch-'0';ch=getchar();}
    return x*f;
}

const int N = 1000 + 10;
const int M = N*N;
const int inf = 0x73f3f3f;

int n,m,mp[N][N];
struct node{
    int pre,v,u,w;
}e[M<<1];

int num=0,head[N];
void addedge(int from,int to,int w){
    e[++num].pre=head[from],e[num].v=to;
    e[num].u=from,e[num].w=w;head[from]=num;
}

int siz=0,ans=inf;
int indx=0,low[N],dfn[N];
void tarjan(int u,int f){
    low[u]=dfn[u]=++indx;++siz;
    for(int i=head[u];i;i=e[i].pre){
        int v=e[i].v;
        if(v==f) continue;
        if(!dfn[v]){
            tarjan(v,u);
            low[u]=min(low[u],low[v]);
            if(dfn[u]<low[v]){
                if(mp[u][v]==1) ans=min(ans,e[i].w);
            }
        }
        else low[u]=min(low[u],dfn[v]);
    }
}

#define ms(x,y) memset(x,y,sizeof(x))
void update(){
    indx=0;ms(low,0);ms(dfn,0);siz=0;
    ms(mp,0);num=0;ms(head,0);ans=inf;
}

int main(){
    while(1){
        n=read(),m=read();
        if(n==0&&m==0) break;
        update();
        for(int i=1;i<=m;++i){
            int u=read(),v=read(),w=read();
            addedge(u,v,w);addedge(v,u,w);
            ++mp[u][v],++mp[v][u];
        }
        tarjan(1,0);
        if(siz<n) printf("0\n");
        else if(ans==inf) printf("-1\n");
        else if(ans==0) printf("1\n");
        else printf("%d\n",ans);
    }
    return 0;
}