HDU4738——Caocao's Bridges
来源:互联网 发布:php warning 关闭 编辑:程序博客网 时间:2024/05/03 20:44
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
Source
2013 ACM/ICPC Asia Regional Hangzhou Online
Recommend
这题坑点太多,如果一开始就不连通,那么就是0,如果最小答案是0,那还是要去一个
还有就是重边的判定。
#include<stdio.h>#include<string.h>#include<iostream>#include<algorithm>using namespace std;const int maxn=1005;const int INF=0x3f3f3f3f;struct node{int id; int to; int next; int weight;}edge[maxn*maxn];int head[maxn];int father[maxn];int low[maxn];int DFN[maxn];bool instack[maxn];int bridge[maxn];int cnt,tot,index,res;int find(int x){ if (father[x]==-1) return x; father[x]=find(father[x]); return father[x];}void merge(int x,int y){ int a=find(x); int b=find(y); if (a!=b) { father[a]=b; cnt--; }}void addedge(int from,int to,int weight,int id){edge[tot].id=id; edge[tot].to=to; edge[tot].weight=weight; edge[tot].next=head[from]; head[from]=tot++;}void tarjan(int u,int fa){ DFN[u]=low[u]=++index; instack[u]=1; for (int i=head[u];i!=-1;i=edge[i].next) { int v=edge[i].to; if (edge[i].id==fa) continue; //printf("%d %d\n",u,v); if (!instack[v]) { tarjan(v,edge[i].id); if (low[u]>low[v]) low[u]=low[v]; if (low[v]>DFN[u]) bridge[res++]=edge[i].weight; } else if (low[u]>DFN[v]) low[u]=DFN[v]; }}int solve(int n){ memset(low,0,sizeof(low)); memset(DFN,0,sizeof(DFN)); memset(instack,0,sizeof(instack)); int ans=INF; res=0; index=0; for (int i=1;i<=n;i++) if (!DFN[i]) tarjan(i,-1); for (int i=0;i<res;i++) if (ans>bridge[i]) ans=bridge[i]; if (ans==INF) return -1; else if (ans==0) return 1; return ans;}int main(){ int n,m; while (~scanf("%d%d",&n,&m)) { if (!n && !m) break; memset(head,-1,sizeof(head)); memset(father,-1,sizeof(father)); tot=0; cnt=n; int s,t,w; for (int i=1;i<=m;i++) { scanf("%d%d%d",&s,&t,&w); addedge(s,t,w,i); addedge(t,s,w,i); merge(s,t); } if (cnt>1) printf("0\n"); else printf("%d\n",solve(n)); } return 0;}
0 0
- HDU4738——Caocao's Bridges
- HDU4738-Caocao's Bridges
- HDU4738 Caocao's Bridges
- HDU4738 Caocao's Bridges(桥)
- 无向图求桥 hdu4738 Caocao's Bridges
- HDU4738 Caocao's Bridges【强连通】
- HDU4738 Caocao's Bridges (求桥)
- 【桥】HDU4738[Caocao's Bridges]题
- Caocao's Bridges hdu4738 (网络赛 杭州赛区) hdu 4738
- hdu4738 Caocao's Bridges 无向图 tarjan 求桥
- hdu4738 Caocao's Bridges(双连通分量割边/桥)
- hdu 4738—— Caocao's Bridges
- hdu 4738——Caocao's Bridges
- HDU 4738 — Caocao's Bridges 判桥
- Caocao's Bridges HDOJ4738
- HDU Caocao's Bridges
- Caocao's Bridges HDU
- hdu 4738 Caocao's Bridges
- 分享平时工作中那些给力的shell命令
- hdu1198
- 汉诺塔
- Oracle Star Schema简析
- Java进阶之欧拉工程 第十三篇【大数求和】
- HDU4738——Caocao's Bridges
- Queue python
- Openstack针对nova,cinder,glance使用ceph的虚拟机创建机制优化
- java单链表实例
- Python语法检查引用PyLint配置的具体方法
- eclipse整合Activiti
- XP系统安装Office 2010出现:windows installer服务不能更新一个或多个受保护的windows文件 解决方法
- Android利用广播---监听应用程序安装和卸载,删除安装包
- python静态代码分析工具——pylint