hdu4738(求最小割桥)

注意重边的处理，还有数组初始化以及结构体的大小开辟。

#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cstring>
#include<cmath>
#include<vector>
#include<queue>
#include<set>
#define mem(a,x) memset(a,x,sizeof(a))
#define s1(x) scanf("%d",&x)
#define s2(x,y) scanf("%d%d",&x,&y)
#define s3(x,y,z) scanf("%d%d%d",&x,&y,&z)
#define s4(x,y,z,k) scanf("%d%d%d%d",&x,&y,&z,&k)
#define ff(a,n) for(int i = 0 ; i < n; i++) scanf("%d",a+i)
#define ls 2*rt
#define rs 2*rt+1
#define lson ls,L,mid
#define rson rs,mid+1,R
#define ll long long
using namespace std;
typedef pair<int,int> pii;
//inline ll ask(int x){ll res=0;while(x)res+=c[x],x-=x&(-x);return res;}
//inline void add(int x,int d){while(x<=n)c[x]+=d,x+=x&(-x);}
//int gcd(int a, int b) { return b == 0 ? a : gcd(b, a%b);}
const ll inf = 0x3f3f3f3f;
const int mx = 1e3+10;
struct {
	int u,v,id,w,ne;
}p[mx*mx];                            //这里应该是mx*mx有时犯傻会开成两倍， 然后就超时了 
int head[mx],ans[mx],dfn[mx],low[mx]; 
int n,m,tol,cnt,ge;
void add(int u,int v,int id, int w){
	p[tol].u=u;
	p[tol].v=v;
	p[tol].id=id;
	p[tol].w = w;
	p[tol].ne = head[u];
	head[u] = tol++;
}
void tarjan(int u,int f){   
	dfn[u]=low[u]=++cnt;
	int ok = 0;
	for(int i = head[u]; i != -1; i =p[i].ne){
		int v = p[i].v;
		if(!dfn[v]){
			tarjan(v,u);
			low[u] = min(low[u],low[v]);
			if(low[v] > dfn[u]){
				ans[ge++] = p[i].w;
		
			}
		}
		else if(v == f){
			if(ok)  low[u] = min(low[u],dfn[v]);
			ok++;
			//  如果没有重边的话这里可以直接 continue 
		}
		else
		low[u] = min(low[u],dfn[v]);
	}
}

int main(){
	//	freopen("F:\\in.txt","r",stdin);
//	int T=10;	scanf("%d",&T);
	while(s2(n,m)){
		if( n== 0 && m == 0)
			break; 
		//s2(n,m);
		int a,b,c;
		tol = 0;
		cnt = ge = 0;
		mem(head,-1);
		mem(dfn,0);     //  忘了清空 
		
		for(int i = 1; i <= m; i++){
			s3(a,b,c);
			add(a,b,i,c);
			add(b,a,i,c);
		}
		tarjan(1,-1);
		if(ge == 0){
			puts("-1");
			continue;
		}
		sort(ans,ans+ge);
		
		if(cnt != n){
			puts("0");
		}
		else{
			printf("%d\n",ans[0] == 0?1:ans[0]);
		}
		
	}
	return 0;
}