How Many Maos Does the Guanxi Worth 5137 (最短路+删点+最大边)
来源:互联网 发布:新浪微博怎么修改域名 编辑:程序博客网 时间:2024/05/16 18:01
How Many Maos Does the Guanxi Worth
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 512000/512000 K (Java/Others)Total Submission(s): 865 Accepted Submission(s): 330
Problem Description
"Guanxi" is a very important word in Chinese. It kind of means "relationship" or "contact". Guanxi can be based on friendship, but also can be built on money. So Chinese often say "I don't have one mao (0.1 RMB) guanxi with you." or "The guanxi between them is naked money guanxi." It is said that the Chinese society is a guanxi society, so you can see guanxi plays a very important role in many things.
Here is an example. In many cities in China, the government prohibit the middle school entrance examinations in order to relief studying burden of primary school students. Because there is no clear and strict standard of entrance, someone may make their children enter good middle schools through guanxis. Boss Liu wants to send his kid to a middle school by guanxi this year. So he find out his guanxi net. Boss Liu's guanxi net consists of N people including Boss Liu and the schoolmaster. In this net, two persons who has a guanxi between them can help each other. Because Boss Liu is a big money(In Chinese English, A "big money" means one who has a lot of money) and has little friends, his guanxi net is a naked money guanxi net -- it means that if there is a guanxi between A and B and A helps B, A must get paid. Through his guanxi net, Boss Liu may ask A to help him, then A may ask B for help, and then B may ask C for help ...... If the request finally reaches the schoolmaster, Boss Liu's kid will be accepted by the middle school. Of course, all helpers including the schoolmaster are paid by Boss Liu.
You hate Boss Liu and you want to undermine Boss Liu's plan. All you can do is to persuade ONE person in Boss Liu's guanxi net to reject any request. This person can be any one, but can't be Boss Liu or the schoolmaster. If you can't make Boss Liu fail, you want Boss Liu to spend as much money as possible. You should figure out that after you have done your best, how much at least must Boss Liu spend to get what he wants. Please note that if you do nothing, Boss Liu will definitely succeed.
Here is an example. In many cities in China, the government prohibit the middle school entrance examinations in order to relief studying burden of primary school students. Because there is no clear and strict standard of entrance, someone may make their children enter good middle schools through guanxis. Boss Liu wants to send his kid to a middle school by guanxi this year. So he find out his guanxi net. Boss Liu's guanxi net consists of N people including Boss Liu and the schoolmaster. In this net, two persons who has a guanxi between them can help each other. Because Boss Liu is a big money(In Chinese English, A "big money" means one who has a lot of money) and has little friends, his guanxi net is a naked money guanxi net -- it means that if there is a guanxi between A and B and A helps B, A must get paid. Through his guanxi net, Boss Liu may ask A to help him, then A may ask B for help, and then B may ask C for help ...... If the request finally reaches the schoolmaster, Boss Liu's kid will be accepted by the middle school. Of course, all helpers including the schoolmaster are paid by Boss Liu.
You hate Boss Liu and you want to undermine Boss Liu's plan. All you can do is to persuade ONE person in Boss Liu's guanxi net to reject any request. This person can be any one, but can't be Boss Liu or the schoolmaster. If you can't make Boss Liu fail, you want Boss Liu to spend as much money as possible. You should figure out that after you have done your best, how much at least must Boss Liu spend to get what he wants. Please note that if you do nothing, Boss Liu will definitely succeed.
Input
There are several test cases.
For each test case:
The first line contains two integers N and M. N means that there are N people in Boss Liu's guanxi net. They are numbered from 1 to N. Boss Liu is No. 1 and the schoolmaster is No. N. M means that there are M guanxis in Boss Liu's guanxi net. (3 <=N <= 30, 3 <= M <= 1000)
Then M lines follow. Each line contains three integers A, B and C, meaning that there is a guanxi between A and B, and if A asks B or B asks A for help, the helper will be paid C RMB by Boss Liu.
The input ends with N = 0 and M = 0.
It's guaranteed that Boss Liu's request can reach the schoolmaster if you do not try to undermine his plan.
For each test case:
The first line contains two integers N and M. N means that there are N people in Boss Liu's guanxi net. They are numbered from 1 to N. Boss Liu is No. 1 and the schoolmaster is No. N. M means that there are M guanxis in Boss Liu's guanxi net. (3 <=N <= 30, 3 <= M <= 1000)
Then M lines follow. Each line contains three integers A, B and C, meaning that there is a guanxi between A and B, and if A asks B or B asks A for help, the helper will be paid C RMB by Boss Liu.
The input ends with N = 0 and M = 0.
It's guaranteed that Boss Liu's request can reach the schoolmaster if you do not try to undermine his plan.
Output
For each test case, output the minimum money Boss Liu has to spend after you have done your best. If Boss Liu will fail to send his kid to the middle school, print "Inf" instead.
Sample Input
4 51 2 31 3 71 4 502 3 43 4 23 21 2 302 3 100 0
Sample Output
50Inf#include<stdio.h>#include<string.h>#include<math.h>#define min(a,b) (a>b?b:a)#define mx 0x3f3f3f3fint n,m,map[50][50];int dis[50],vis[50];void djs(int x,int y)//y表示要删去的点 ,dijkstra算法模板 {int i,j,k;memset(vis,0,sizeof(vis));for(i=1;i<=n;i++){dis[i]=mx;}dis[x]=0;for(j=1;j<=n;j++){if(j==y)continue;k=-1;for(i=1;i<=n;i++){if(!vis[i]&&(k==-1||dis[i]<dis[k]))k=i;}if(k==-1)break;vis[k]=1;for(i=1;i<=n;i++){if(i==y)continue;dis[i]=min(dis[i],dis[k]+map[k][i]);}}}int main(){while(scanf("%d%d",&n,&m),n||m){int a,b,c,i;memset(map,mx,sizeof(map));while(m--){scanf("%d%d%d",&a,&b,&c);if(map[a][b]>c)map[a][b]=map[b][a]=c;//这是双向的,开始一直理解成单向的。 }int ok=0,max=-1;for(i=2;i<n;i++){djs(1,i);//删点与求最短路 if(dis[n]==mx)//表示不能到达n点 {ok=1;break;}if(max<dis[n])//一直寻求最大值 max=dis[n];}if(ok==1)printf("Inf\n");elseprintf("%d\n",max);}return 0;}
0 0
- How Many Maos Does the Guanxi Worth 5137 (最短路+删点+最大边)
- 杭电-5137How Many Maos Does the Guanxi Worth(删点枚举+最短路)
- hdoj 5137 How Many Maos Does the Guanxi Worth 【枚举删点 + 最短路】
- HDOJ 5137 How Many Maos Does the Guanxi Worth(最短路删点)
- hdoj 5137 How Many Maos Does the Guanxi Worth 【最短路 + 删点】
- 【最短路】HDU5137 How Many Maos Does the Guanxi Worth
- hdu 5137 How Many Maos Does the Guanxi Worth (最短路SPAF实现)
- HDOJ 5137 How Many Maos Does the Guanxi Worth(最短路)
- HDU 5137 How Many Maos Does the Guanxi Worth(最短路--dijkstra)
- HDU 5137 How Many Maos Does the Guanxi Worth (最短路)
- HDU 5137 How Many Maos Does the Guanxi Worth(最短路)
- 枚举+dijkstra(最短路删点) hdu5137How Many Maos Does the Guanxi Worth
- HDU5137How Many Maos Does the Guanxi Worth(最短路)
- [ACM] HDU 5137 How Many Maos Does the Guanxi Worth(去掉一个点使得最短路最大化)
- hdoj 5137 How Many Maos Does the Guanxi Worth【最短路】
- HDU 5137 How Many Maos Does the Guanxi Worth (14广州 Floyd 最短路)
- HDU 5137--How Many Maos Does the Guanxi Worth【枚举 && 最短路 && spfa】
- hdoj 5137 How Many Maos Does the Guanxi Worth【最短路 Floyd】
- Leetcode 136 Single Number 仅出现一次的数字
- Ubuntu完全教程
- 线索二叉树
- 迪杰斯特拉(最短路径)
- linux线程相关小结
- How Many Maos Does the Guanxi Worth 5137 (最短路+删点+最大边)
- OC_Delegate(代理)
- Daemon守护进程
- Java中Iterator(迭代器)的一般用法
- leetcode 134: Gas Station
- TeleTable( Data Structure { Trie && SegmentTree} )
- c++类的初创建(复数类)
- MCV中字典转模型的KVC底层实现
- Spring与Hibernate与Struts整合(一)配置文件