hdoj 5137 How Many Maos Does the Guanxi Worth 【最短路 + 删点】
来源:互联网 发布:origin作图软件官网 编辑:程序博客网 时间:2024/05/17 06:12
How Many Maos Does the Guanxi Worth
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 512000/512000 K (Java/Others)Total Submission(s): 1057 Accepted Submission(s): 372
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题意:刘老板想通过关系让儿子上学校,但每层关系都要付报酬,你的任务是破坏刘老板走后门的企图,你可以使刘老板的关系网中的任何一人(不包括;刘老板(1)和校长(n))拒绝任何要求(也就是和这个人的关系都断了),求从1到n的最短路的最长(花费最多的钱)是多少,存在这个值则输出此值,不存在输出Inf。代码:#include<stdio.h>#include<algorithm>#include<string.h>#define INF 0x3f3f3f#define MAX 35using namespace std;int map[MAX][MAX],low[MAX],vis[MAX];int rec[MAX][MAX];//记录 int n;void init(){for(int i=1;i<=n;i++){for(int j=1;j<=n;j++){if(i==j)map[i][j]=0;elsemap[i][j]=INF;}}}int dijkstra(){int Min,i,j,next;memset(vis,0,sizeof(vis));for(i=1;i<=n;i++){low[i]=map[1][i];}vis[1]=1;for(i=1;i<n;i++){Min=INF;for(j=1;j<=n;j++){if(!vis[j]&&Min>low[j]){Min=low[j];next=j;}}vis[next]=1;for(j=1;j<=n;j++){//if(!vis[j]&&low[j]<low[next]+map[next][j]);//不能这样写,low[j]值会越来越大; //{//low[j]=low[next]+map[next][j];//} if(!vis[j]&&map[next][j]!=INF)//先判断next于j存不存在关系; { low[j]=min(low[j],low[next]+map[next][j]);}}}return low[n];}void solve(){int i,j,f=0;//f判断是否成功破坏; int ans=dijkstra();for(i=2;i<=n-1;i++){for(j=1;j<=n;j++){rec[i][j]=rec[j][i]=map[i][j];map[i][j]=map[j][i]=INF;}if(dijkstra()==INF){f=1;break;}ans=max(dijkstra(),ans);for(j=1;j<=n;j++){map[i][j]=map[j][i]=rec[i][j];}}if(f)printf("Inf\n");elseprintf("%d\n",ans);}int main(){int m,a,b,c,i;while(scanf("%d%d",&n,&m)!=EOF&&n|m){init();for(i=1;i<=m;i++){scanf("%d%d%d",&a,&b,&c);if(map[a][b]>c)map[a][b]=map[b][a]=c;}solve();}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 【最短路 + 删点】
- 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【最短路 Floyd】
- 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
- HDOJ--5137--How Many Maos Does the Guanxi Worth
- HDOJ 5137 How Many Maos Does the Guanxi Worth
- [ACM] HDU 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】
- hdu 5137 How Many Maos Does the Guanxi Worth (最短路SPAF实现)
- HDU 5137 How Many Maos Does the Guanxi Worth (Floyd 最短路)
- HDU 5137 How Many Maos Does the Guanxi Worth(最短路--dijkstra)
- Iphone程序运行流程
- hdu 4585 set + pair
- jquery核心基础
- linux下升级pip安装不了第三方库的解决方法
- hdu 1525 Euclid's Game
- hdoj 5137 How Many Maos Does the Guanxi Worth 【最短路 + 删点】
- Undefined symbols for architecture i386:和"_OBJC_CLASS_$_xx", referenced from:问题解决方法
- window服务器 合并分区
- NSDate - 常用方法
- IOS的socket开发基础
- Algorithms—242.Valid Anagram
- java常见的面试题
- 在table中tr的display:block在firefox,chrome下显示布局错乱问题
- android中跨进程通讯的4种方式