Caocao's Bridges hdu4738 (网络赛 杭州赛区) hdu 4738
来源:互联网 发布:js点击显示隐藏div 编辑:程序博客网 时间:2024/05/17 01:36
Caocao's Bridges
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 10 Accepted Submission(s): 3
Problem 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 <= N2 )
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.
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 <= N2 )
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 31 2 72 3 43 1 43 21 2 72 3 40 0
Sample Output
-14
#include <iostream>#include <string>#include <string.h>using namespace std;#define MAXN 1001#define INF 999999999int n, m;struct Edge{ int v, next, w;}edge[MAXN * MAXN * 2];int head[MAXN], e, ind, mi;int dfn[MAXN], low[MAXN];int c[MAXN][MAXN];bool vis[MAXN];bool exist[MAXN];void add(int u, int v, int w){ edge[e].v = v; edge[e].w = w; edge[e].next = head[u]; head[u] = e++;}void init(){ e = 0; ind = 0; memset(head, -1, sizeof(head)); memset(dfn, 0, sizeof(dfn)); memset(low, 0, sizeof(low)); memset(c, 0, sizeof(c)); memset(vis, false, sizeof(vis)); memset(exist, false, sizeof(exist));}void tarjan(int u, int father){ dfn[u] = low[u] = ++ind; for (int i = head[u]; i != -1; i = edge[i].next) { int v = edge[i].v; if (v == father) { continue; } if (!dfn[v]) { tarjan(v, u); low[u] = min(low[u], low[v]); if (dfn[u] < low[v] && c[u][v] == 1) { mi = min(mi, edge[i].w); } } else { low[u] = min(low[u], dfn[v]); } }}void solve(){ int num = 0; mi = INF; for (int i = 1; i <= n; i++) { if (!dfn[i]) { num++; tarjan(i, 0); } } if (num != 1) { cout << 0 << endl; } else if (mi == INF) { cout << -1 << endl; } else { if (mi == 0) { cout << 1 << endl; //坑 } else { cout << mi << endl; } }}void input(){ int u, v, w; while (cin >> n >> m) { if (n == 0 && m == 0) { break; } init(); for (int i = 0; i < m; i++) { cin >> u >> v >> w; c[u][v]++; c[v][u]++; add(u, v, w); add(v, u, w); } solve(); }}int main(){ std::ios::sync_with_stdio(false); input(); return 0;}/*2 11 2 32 21 2 42 1 53 31 2 32 3 43 1 53 31 2 72 3 43 1 43 21 2 72 3 47 91 2 31 3 42 4 33 4 44 5 95 6 25 7 16 8 37 8 47 81 2 31 3 42 4 33 4 44 5 95 6 25 7 16 8 37 8 4*/
- Caocao's Bridges hdu4738 (网络赛 杭州赛区) hdu 4738
- hdu 4738 Caocao's Bridges 2013 ACM-ICPC杭州赛区网络赛 1001 双连通分量
- hdu 4738 Caocao's Bridges(2013杭州网络赛丶神坑)
- hdu 4738 Caocao's Bridges(2013杭州网络赛丶神坑)
- HDU4738-Caocao's Bridges
- HDU4738 Caocao's Bridges
- HDU4738 Caocao's Bridges(桥)
- hdu 4738 Caocao's Bridges
- hdu 4738 Caocao's Bridges
- hdu 4738 Caocao's Bridges
- HDU:4738 Caocao's Bridges
- HDU 4738 Caocao's Bridges
- HDU 4738 Caocao's Bridges
- hdu 4738 - Caocao's Bridges
- hdu 4738 Caocao's Bridges
- HDU-4738Caocao's Bridges
- 无向图求桥 hdu4738 Caocao's Bridges
- HDU4738——Caocao's Bridges
- eclipse 汉化 svn安装
- 各国iPhone5系列最新裸机价格
- androidmanifest.xml中声明相关权限
- .yml是什么文件
- delphi实现com+远程(包括本地)调用
- Caocao's Bridges hdu4738 (网络赛 杭州赛区) hdu 4738
- 雅虎三道面试题
- NoSQL新趋势:实时分析和数据库整合
- win32多线程程序设计笔记(第五章)
- vi与vim区别
- toj3072 Train Order
- 2013华为你知道多少?
- 区域赛 (求割桥)
- Google自带语音播放功能实现