题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=4738
坑:
不连通的,输出0.
图有重边,需要处理。
如果取到的最小值是0的话,要输出1。
代码:
#include <stdio.h>
#include <ctime>
#include <math.h>
#include <limits.h>
#include <complex>
#include <string>
#include <functional>
#include <iterator>
#include <algorithm>
#include <vector>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <list>
#include <bitset>
#include <sstream>
#include <iomanip>
#include <fstream>
#include <iostream>
#include <ctime>
#include <cmath>
#include <cstring>
#include <cstdio>
#include <time.h>
#include <ctype.h>
#include <string.h>
#include <assert.h>
#pragma comment (linker, "/STACK:102400000,102400000")
using namespace std;
int n, m, x, y;
const int MAXN = 1001000;
const int MAXM = 1000100;
int num;
char tmp;
vector<pair<int, int> > a;
int weight[1100][1100];
int cnt[1100][1100];
struct Edge
{
int to, next;
bool cut;//是否为桥的标记
}edge[MAXM];
int head[MAXN], tot;
int Low[MAXN], DFN[MAXN], Stack[MAXN];
int Index, top;
bool Instack[MAXN];
bool cut[MAXN];
int add_block[MAXN];//删除一个点后增加的连通块
int bridge;
void addedge(int u, int v)
{
edge[tot].to = v;
edge[tot].next = head[u];
edge[tot].cut = false;
head[u] = tot++;
}
void Tarjan(int u, int pre)
{
int v;
Low[u] = DFN[u] = ++Index;
Stack[top++] = u;
Instack[u] = true;
int son = 0;
for (int i = head[u]; i != -1; i = edge[i].next)
{
v = edge[i].to;
if (v == pre)continue;
if (!DFN[v])
{
son++;
Tarjan(v, u);
if (Low[u] > Low[v])Low[u] = Low[v];
//桥
//一条无向边(u,v)是桥,当且仅当(u,v)为树枝边,且满足DFS(u)<Low(v)。
if (Low[v] > DFN[u])
{
bridge++;
edge[i].cut = true;
edge[i ^ 1].cut = true;
a.push_back(make_pair(min(u, v), max(u, v)));
}
//割点
//一个顶点u是割点,当且仅当满足(1)或(2) (1) u为树根,且u有多于一个子树。
//(2) u不为树根,且满足存在(u,v)为树枝边(或称父子边,
//即u为v在搜索树中的父亲),使得DFS(u)<=Low(v)
if (u != pre && Low[v] >= DFN[u])//不是树根
{
cut[u] = true;
add_block[u]++;
}
}
else if (Low[u] > DFN[v])
Low[u] = DFN[v];
}
//树根,分支数大于1
if (u == pre && son > 1)cut[u] = true;
if (u == pre)add_block[u] = son - 1;
Instack[u] = false;
top--;
}
///
int fa[1010];
int find(int x)
{
if (fa[x] == -1) return x;
else return fa[x] = find(fa[x]);
}
void un(int x, int y)
{
int fx = find(x);
int fy = find(y);
if (fx != fy) fa[fx] = fy;
}
/
void solve(int N)
{
memset(DFN, 0, sizeof(DFN));
memset(Instack, false, sizeof(Instack));
memset(add_block, 0, sizeof(add_block));
memset(cut, false, sizeof(cut));
Index = top = 0;
bridge = 0;
for (int i = 1; i <= N; i++)
if (!DFN[i])
Tarjan(i, i);
//get ans
int ok = 1;
for (int i = 1;i <= n;i++)
if (find(i) != find(1))
{
ok = 0;
break;
}
if (!ok) printf("0\n");//判断是否联通
else if (a.size() == 0) printf("-1\n");//是否存在割边
else
{
int ans = 1e9;
for (int i = 0;i < a.size();i++)
{
int u = a[i].first;
int v = a[i].second;
if (cnt[u][v] == 1)//重边
ans = min(ans, weight[u][v]);
}
if (ans == 0) ans = 1;//最小割为0?
if (ans == 1e9) ans = -1;
printf("%d\n",ans);
}
}
void init()
{
tot = 0;
num = 0;
a.clear();
memset(head, -1, sizeof(head));
}
int main()
{
while (~scanf("%d %d", &n ,&m) && n)
{
init();
memset(weight, 0, sizeof(weight));
memset(fa,-1,sizeof(fa));
memset(cnt, 0, sizeof(cnt));
int u, v, w;
for (int i = 1; i <= m; i++)
{
scanf("%d%d%d", &u, &v, &w);
addedge(u, v);
addedge(v, u);
cnt[u][v]++;
cnt[v][u]++;
un(u, v);
if (weight[u][v] == 0 || (weight[u][v] > w))
weight[u][v] = weight[v][u] = w;
}
solve(n);
}
return 0;
}