HDU:4738 Caocao's Bridges

无向图求桥。

虽然是模版题但是有几个trick。

1，图可能不连通，这样答案输出0

2，有重边，重边肯定不是桥

3，如果最小值是0，那么应该输出1，因为至少要派一个人去炸桥。

#include <iostream>
#include <cstdio>
#include <cstring>
#include <string>
#include <cmath>
#include <vector>
#include <queue>
#include <algorithm>
#define ll long long
#define INF 2139062143
#define MOD 20071027
#define MAXN 1005
using namespace std;
int gl[MAXN][MAXN],N,M;
int edge[MAXN][MAXN];
int vis[MAXN],dfn[MAXN],low[MAXN];
bool isbridge[MAXN][MAXN];
void cut_bridge(int cur,int father,int dep)
{
    vis[cur]=1;
    dfn[cur]=low[cur]=dep;
    int child=0;
    for(int i=1; i<=N; ++i)
        if(edge[cur][i])
        {
            if(i!=father&&vis[i]==1)
                low[cur]=min(low[cur],dfn[i]);
            if(vis[i]==0)
            {

                cut_bridge(i,cur,dep+1);
                child++;
                low[cur]=min(low[cur],low[i]);
                if(low[i]>dfn[cur]&&edge[i][cur]==1) isbridge[cur][i]=isbridge[i][cur]=true;

            }
        }
    vis[cur]=2;
}
int main()
{
    while(scanf("%d%d",&N,&M))
    {
        if(!N&&!M) break;
        int u,v,w;
        memset(gl,0,sizeof(gl));
        memset(edge,0,sizeof(edge));
        memset(vis,0,sizeof(vis));
        memset(dfn,0,sizeof(dfn));
        memset(low,0,sizeof(low));
        memset(isbridge,0,sizeof(isbridge));
        for(int i=0; i<M; ++i)
        {
            scanf("%d%d%d",&u,&v,&w);
            edge[u][v]++;
            edge[v][u]++;
            gl[u][v]=w;
            gl[v][u]=w;
        }
        int s=0;
        for(int i=1; i<=N; ++i)
            if(!vis[i])
            {
                s++;
                cut_bridge(i,-1,0);
            }
        int minn=INF;
        for(int i=1; i<=N; ++i)
            for(int j=i; j<=N; ++j)
                if(isbridge[i][j])
                    minn=min(minn,gl[i][j]);
        if(s!=1) printf("0\n");
        else if(minn==INF) printf("-1\n");
        else if(minn==0) printf("1\n");
        else printf("%d\n",minn);
    }
    return 0;
}