hdu 4005(双连通)
来源:互联网 发布:淘宝一键删除所有宝贝 编辑:程序博客网 时间:2024/05/16 02:09
The war
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65768/65768 K (Java/Others)Total Submission(s): 656 Accepted Submission(s): 115
Problem Description
In the war, the intelligence about the enemy is very important. Now, our troop has mastered the situation of the enemy's war zones, and known that these war zones can communicate to each other directly or indirectly through the network. We also know the enemy is going to build a new communication line to strengthen their communication network. Our task is to destroy their communication network, so that some of their war zones can't communicate. Each line has its "cost of destroy". If we want to destroy a line, we must spend the "cost of destroy" of this line. We want to finish this task using the least cost, but our enemy is very clever. Now, we know the network they have already built, but we know nothing about the new line which our enemy is going to build. In this condition, your task is to find the minimum cost that no matter where our enemy builds the new line, you can destroy it using the fixed money. Please give the minimum cost. For efficiency, we can only destroy one communication line.
Input
The input contains several cases. For each cases, the first line contains two positive integers n, m (1<=n<=10000, 0<=m<=100000) standing for the number of the enemy's war zones (numbered from 1 to n), and the number of lines that our enemy has already build. Then m lines follow. For each line there are three positive integer a, b, c (1<=a, b<=n, 1<=c<=100000), meaning between war zone A and war zone B there is a communication line with the "cost of destroy " c.
Output
For each case, if the task can be finished output the minimum cost, or output ‐1.
Sample Input
3 21 2 12 3 24 31 2 11 3 21 4 3
Sample Output
-13HintFor the second sample input: our enemy may build line 2 to 3, 2 to 4,3 to 4. If they build line 2 to 3, we will destroy line 1 to 4, cost 3. If theybuild line 2 to 4, we will destroy line 1 to 3, cost 2. If they build line 3 to 4,we will destroy line 1 to 2, cost 1. So, if we want to make sure that we candestroy successfully, the minimum cost is 3.
Source
The 36th ACM/ICPC Asia Regional Dalian Site —— Online Contest
Recommend
lcy
题目:http://acm.hdu.edu.cn/showproblem.php?pid=4005
分析:这题是大连赛区的第5题,可惜当时不会双连通阿~~~
首先将所有双连通分量缩成一些点,剩下的点就是一棵无根树,题目要求出一个最小权值使得任意加一条边后都能去掉一条小于这个权值的边,使得图不连通,最坏情况下肯定是把最小边的两端连起来,由于只要连树叶点就行,于是我们就以最小边的两个端点为根,找两棵树中的各一条路径,使得路径包含的边尽量小,其实也就是所有节点与其子节点的边的次小值中的最小值就是答案。。。晕
代码:
#include<cstdio>#define min(a,b) (a<b?a:b)using namespace std;const int mm=222222;const int mn=11111;const int oo=1000000000;int t[mm],c[mm],p[mm];int h[mn],q[mn],low[mn],dfn[mn],id[mn],w[mn][3];int i,j,s,e,k,n,m,cnt,top,et,idx,ans;inline void add(int u,int v,int s){ t[e]=v,c[e]=s,p[e]=h[u],h[u]=e++; t[e]=u,c[e]=s,p[e]=h[v],h[v]=e++;}void dfs(int u,int fa){ dfn[u]=low[u]=++idx; q[top++]=u; for(int i=h[u],v;i>=0;i=p[i]) if(!dfn[v=t[i]]) { dfs(v,u); low[u]=min(low[u],low[v]); if(dfn[u]<low[v]) { id[v]=++cnt,w[++et][0]=u,w[et][1]=v,w[et][2]=c[i]; while(q[--top]!=v)id[q[top]]=cnt; } } else if(v!=fa)low[u]=min(low[u],dfn[v]);}void find(int u){ int i,v; low[u]=oo; for(i=h[u];i>=0;i=p[i]) if(!q[v=t[i]]) { q[v]=1,find(v); low[v]=min(low[v],c[i]); if(low[v]<low[u])ans=min(ans,low[u]),low[u]=low[v]; else ans=min(ans,low[v]); }}int tarjan(){ int i,j,k,mi; for(cnt=idx=top=i=et=0;i<=n;++i)dfn[i]=0; for(i=1;i<=n;++i) if(!dfn[i]) { dfs(i,i); ++cnt; while(top--)id[q[top]]=cnt; } for(i=e=0;i<=cnt;++i)h[i]=-1,q[i]=0; for(mi=k=1;k<=et;++k) { add(id[w[k][0]],id[w[k][1]],w[k][2]); if(w[k][2]<w[mi][2])mi=k; } q[i=id[w[mi][0]]]=q[j=id[w[mi][1]]]=1; ans=oo; find(i),find(j); return (ans<oo)?ans:-1;}int main(){ while(scanf("%d%d",&n,&m)!=-1) { for(i=e=0;i<=n;++i)h[i]=-1; while(m--)scanf("%d%d%d",&i,&j,&s),add(i,j,s); printf("%d\n",tarjan()); } return 0;}
- hdu 4005(双连通)
- hdu 4005 双连通
- hdu 4005(边双连通)
- 【HDU】4005 The war 边双连通
- hdu 3749 点双连通
- hdu 3394(点双连通)
- hdu 5739(点双连通)
- HDU 5739(点双连通)
- HDU - 4005 The war(dfs+边双连通)
- HDU 4005 The war(边双连通+缩点)
- HDU 4738 双连通模版题
- HDU 4612 Warm up 边双连通
- 【HDU】2460 Network 双连通+LCA变形
- hdu 4738 双连通图的桥
- HDU 5739 (点双连通 树DP)
- 【边双连通 && 树的直径】HDU
- HDU 4005 The war(双连通好题)
- HDU 4005 The war 边-双连通缩点+树形dp
- C# 改变窗体大小时背景图片会闪烁解决办法
- [JavaScript] JavaScript中的类型,竟然也有继承关系。好吧,这个以后得好好看
- http日志分析工具awstat安装详解(续篇)--AWStats did not find any valid log lines that match your LogFormat paramet
- 重定向与句柄备份
- Lustre并行文件系统的部署和测试
- hdu 4005(双连通)
- hdu 1695 ( “变态” 的欧拉函数 加 容斥原理)
- C#版的MsMultiPartFormData(上传二进流数据到服务器 multipart/form-data)
- C# 如何创建与读写txt文件
- 验证身份证号码
- 使用struts2+jquery+ajax生成联动下拉列表框(select)
- MYSQL数据库 一些语句
- javascript 事件队列加载函数 addLoadEvent
- python输出中文