HDOJ 5137 How Many Maos Does the Guanxi Worth(最短路)
来源:互联网 发布:java中图片上传和回显 编辑:程序博客网 时间:2024/04/30 02:45
How Many Maos Does the Guanxi Worth
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 512000/512000 K (Java/Others)Total Submission(s): 1030 Accepted Submission(s): 352
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
50Infac代码:#include<stdio.h>#include<string.h>#include<math.h>#include<iostream>#include<algorithm>#define MAXN 1010#define INF 0xfffffff#define max(a,b) a>b?a:b#define min(a,b) a>b?b:ausing namespace std;int pri[MAXN][MAXN];int map[MAXN][MAXN];int v[MAXN];int dis[MAXN];int n;int sum;void dijkstra(){ int i,j,k; int mi; memset(v,0,sizeof(v)); for(i=1;i<=n;i++) dis[i]=map[1][i]; v[1]=1; for(i=1;i<n;i++) { mi=INF; k=i; for(j=1;j<=n;j++) { if(v[j]==0&&dis[j]<mi) { mi=dis[j]; k=j; } } if(mi==INF) break; v[k]=1; for(j=1;j<=n;j++) { if(v[j]==0) dis[j]=min(dis[j],dis[k]+map[k][j]); } }}int main(){ int i,j; int m,k; int a,b,c; while(scanf("%d%d",&n,&m)!=EOF,n||m) { for(i=1;i<=n;i++) for(j=1;j<=n;j++) pri[i][j]=i==j?0:INF; for(i=0;i<m;i++) { scanf("%d%d%d",&a,&b,&c); if(pri[a][b]>c) pri[a][b]=pri[b][a]=c; } int M=0; for(i=2;i<n;i++) { for(j=1;j<=n;j++) { for(k=1;k<=n;k++) { if(j==i||k==i) { map[j][k]=INF; } else { map[j][k]=pri[j][k]; } } } dijkstra(); M=M<dis[n]?dis[n]:M; } if(M==INF) printf("Inf\n"); else printf("%d\n",M); } return 0;}
0 0
- 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 【枚举删点 + 最短路】
- hdoj 5137 How Many Maos Does the Guanxi Worth【最短路 Floyd】
- 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 (最短路--Floyd)
- 【最短路】HDU5137 How Many Maos Does the Guanxi Worth
- hdu 5137 How Many Maos Does the Guanxi Worth (最短路SPAF实现)
- How Many Maos Does the Guanxi Worth 5137 (最短路+删点+最大边)
- HDU 5137 How Many Maos Does the Guanxi Worth(最短路--dijkstra)
- 杭电-5137How Many Maos Does the Guanxi Worth(删点枚举+最短路)
- HDU 5137 How Many Maos Does the Guanxi Worth (最短路)
- HDU 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
- HDU5137How Many Maos Does the Guanxi Worth(最短路)
- HDU 5137 How Many Maos Does the Guanxi Worth (14广州 Floyd 最短路)
- UVa 1613:K-Graph Oddity(BFS)
- 字典数据类型-字典常见操作
- RPC和NFS还有如此的渊源TODO
- 学习Spring必学的Java基础知识(7)----事务基础知识
- Android数据库ORMlite框架翻译系列(第一章)
- HDOJ 5137 How Many Maos Does the Guanxi Worth(最短路)
- GitHub 优秀的 Android 开源项目
- 关于scanf接受键盘输入的细节
- 轻松点,来做个手机网游吧 开篇
- php中的注释
- 黑马程序员-c语言指针总结
- java 接收json数据
- 列表数据类型-列表常用操作
- MVC+EasyUI实现查询显示到相应表格