HDU 4738 — Caocao's Bridges 判桥

原题：http://acm.hdu.edu.cn/showproblem.php?pid=4738

题意：

有n个点，m条无向边；

下面给出m条边的权值；

求所有桥中最小的权值；

注意：

1、图可能不连通，那么就输出0；

2、最小的权值可能为0，这时候输出的是1而不是0；

3、可能存在重边；

#include<stdio.h>
#include<string.h>   
#include<vector>
#include<iostream>
#include<algorithm>  
#define inf 1e9
const int N = 1010;
using namespace std;

vector<int>G[N];
int dis[N][N], bian[N][N];
int n, m;
int f[N];

int find(int x)
{
	if(x == f[x])
	return x;
	else
	return f[x] = find(f[x]);
}

void Union(int u, int v)
{
    int fa = find(u);
	int fb = find(v);
    f[fa] = fb;
}

struct node
{
    int u, v, d;
}edge[N];

int edgenum;
void PUT(int u, int v, int d)
{
    node E = {u, v, d};
    edge[edgenum++] = E;
}

int pre[N], low[N], dfs_clock;
bool k;
int dfs(int u, int fa)
{
    if(k)return 0;
	int lowu = pre[u] = ++dfs_clock;
    int child = 0;
    for(int i = 0;i<G[u].size();i++)
	{
        int v = G[u][i];
        if(!pre[v])
		{
            child++;
            int lowv = dfs(v, u);
            lowu = min(lowu, lowv);
			if(lowv > pre[u] && bian[u][v] == 1)
			{
				PUT(u, v, dis[u][v]);
				if(dis[u][v]<=1)
				return 0;
			}
        }
        else if(pre[v] < pre[u] && v!=fa)
            lowu = min(lowu, pre[v]);
    }
    return low[u] = lowu;
}

void findcut()
{
    memset(pre, 0, sizeof(pre));
    dfs_clock = 0;
    dfs(1,-1);
}

int main()
{
	while(scanf("%d%d", &n, &m)!=EOF)
	{
		if(n == 0 && m == 0)
		break;
		memset(bian, 0, sizeof bian);
		for(int i = 1;i<=n;i++)
		{
			G[i].clear();
			f[i] = i;
			for(int j = 1;j<=n;j++)
			dis[i][j] = inf;
		}
		while(m--)
		{
			int u, v, w;
			scanf("%d%d%d", &u, &v, &w);
			if(dis[u][v] == inf)
			{
				G[u].push_back(v);
				G[v].push_back(u);
				Union(u, v);
			}
			dis[u][v] = dis[v][u] = min(dis[u][v], w);
			bian[u][v]++;
			bian[v][u]++;
		}
		bool flag = false; 
		find(1);
		for(int i = 1;i<=n;i++)
		{
			if(find(i)!=f[1])
			{
				flag = true;
				break;
			}
		}
		if(flag)
		{
			printf("0\n");
			continue;
		}
		k = false;
		edgenum = 0;
		findcut();
		if(edgenum)
		{
			int ans = inf;
			for(int i = 0;i<edgenum;i++)
				ans = min(ans, edge[i].d);
			if(ans == inf)
			ans = -1;
			if(ans == 0)
			ans = 1;
			printf("%d\n", ans);
		}
		else
		printf("-1\n");
	}
	return 0;
}