hdu5137最短路
2014-12-09 19:21
405 查看
How Many Maos Does the Guanxi Worth
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 512000/512000 K (Java/Others)Total Submission(s): 288 Accepted Submission(s): 87
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.
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.
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
Source
2014ACM/ICPC亚洲区广州站-重现赛(感谢华工和北大)
题意:
给你n个点,编号从1~n,m条边。问删去一个点后,1到达n点的最短路径,最大是多少。
思路:
就像题意说的,我们暴力枚举删去的点,求最短路,找到最大的那个就好,这里用dijskra,或者SPFA算法都可以。这里用dijskra举例。SPFA可以去百度学习一下。
代码:
#include<cstdio>
#include<cmath>
#include<iostream>
#include<algorithm>
#include<cstring>
using namespace std;
#define INF 0x3f3f3f3f
int map[35][35],map1[35][35];//map存原图,map1存删点之后的图
bool visit[35];
int dis[35];
int ans,min1,n,m,x,y,z,k;
void init()
{
for(int i=1; i<=n; ++i)
for(int j=1; j<=n; ++j)
map1[i][j]=map[i][j];
}
void dfs()//dijskra算法
{
memset(visit,0,sizeof(visit));
for(int i=1;i<=n;i++)
dis[i]=map1[1][i];
visit[1]=1;k=1;
dis[1]=0;
for(int i=1;i<n;i++)
{
min1=INF;
for(int j=1;j<=n;j++)
{
if(visit[j]==0&&dis[j]<min1)
{
min1=dis[j];
k=j;
}
}
visit[k]=1;
for(int j=1;j<=n;j++)
{
if(visit[j]==0&&dis[j]>dis[k]+map1[k][j])
dis[j]=dis[k]+map1[k][j];
}
}
ans=max(ans,dis
);
}
int main()
{
while(cin >>n >> m){
if(!n&&!m)break;
for(int i=1; i<=n; ++i)//原图初始化
for(int j=1; j<=n; ++j)
map[i][j]=INF;
for(int i=0; i<m; ++i){//读入原图
cin >> x >> y >>z;
if(map[x][y]>z)
map[y][x]=map[x][y]=z;
}
<
4000
p> ans=-1;
for(int i=2; i<n; ++i){
init();
for(int I=1; I<=n; ++I){//删点操作
map1[i][I]=INF;
map1[I][i]=INF;
}
dfs();
}
if(ans>=INF)
cout<<"Inf"<<endl;
else
cout<<ans<<endl;
}
return 0;
}
相关文章推荐
- Poj2638 网络流+最短路+二分答案
- Aizu1311 分层图最短路 (...大概)
- 单源最短路深度分析
- 2014西安邀请赛部分题解
- 2014 西安邀请赛状压DP
- 2013长沙邀请赛Travel in time
- hdu 2544 最短路(简单的Floyd)
- hdu 3790 最短路径问题 (dijkstra算法+memset()用法)
- poj 2253 Frogger(dijkstra)
- hdu 2544 最短路 (Bellman_Ford算法)
- hdu 2690 Choose the best route (bellman_ford)
- hdu 1596 find the safest road(spfa算法)
- [BZOJ1266][AHOI2006][最短路][最小割]上学路线
- 最短路(Dijstra) 畅通工程续
- 最短路(Dijstra) 一个人的旅行
- 最短路 (Dijstra) 最短路
- 最短路 (Dijstra) Til the Cows Come Home
- 最短路(Dijstra+矩阵转置) Silver Cow Party
- 最短路
- A strange lift