hdoj5137How Many Maos Does the Guanxi Worth【最短路】
2016-01-10 16:54
447 查看
How Many Maos Does the Guanxi Worth
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 512000/512000 K (Java/Others)Total Submission(s): 1519 Accepted Submission(s): 582
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 5
1 2 3
1 3 7
1 4 50
2 3 4
3 4 2
3 2
1 2 30
2 3 10
0 0
Sample Output
50
Inf
Source
2014ACM/ICPC亚洲区广州站-重现赛(感谢华工和北大)
#include<cstdio> #include<cstdlib> #include<cstring> #include<algorithm> #include<cmath> #define inf 0x3f3f3f3f using namespace std; const int maxn=35; int n,m; int dist[maxn]; bool vis[maxn]; int map[maxn][maxn]; int getnext(){ int temp=inf,pos=-1; for(int i=1;i<=n;++i){ if(temp>dist[i]&&!vis[i]){ temp=dist[i];pos=i; } } return pos; } int dijkstra(){ int pos=1; memset(dist,0x3f,sizeof(dist)); vis[pos]=true;dist[pos]=0; while(pos!=-1){ for(int i=1;i<=n;++i){ if(dist[i]>dist[pos]+map[pos][i])dist[i]=dist[pos]+map[pos][i]; } vis[pos]=true; if(vis )return dist ; pos=getnext(); } return inf; } int main() { int i,j,k; while(scanf("%d%d",&n,&m),n||m){ int a,b,c; memset(map,0x3f,sizeof(map)); for(i=0;i<m;++i){ scanf("%d%d%d",&a,&b,&c); if(map[a][b]>c){ map[a][b]=map[b][a]=c; } } int ans=0; memset(vis,false,sizeof(vis)); ans=max(ans,dijkstra()); for(i=2;i<n;++i){ memset(vis,false,sizeof(vis)); vis[i]=true; ans=max(ans,dijkstra()); } if(ans==inf){ printf("Inf\n"); } else { printf("%d\n",ans); } } return 0; }
相关文章推荐
- mysql "too many connections" 错误 之 mysql解决方法
- linux bash中too many arguments问题的解决方法
- many-to-many
- 在Linux中打开了太多文件(Too many open files)的解决方法
- HDU How Many Tables
- HDU1316 How Many Fibs? 【大数】
- hdu1978 How many ways
- HDOJ1978 How many ways【dp or 记忆化搜索】
- hdoj2157How many ways??【矩阵快速幂】
- Jetty提交数据时报java.lang.IllegalStateException: Form too large270468>200000问题解决
- 杭电1213-How Many Tables
- Thanks for your help
- Too many connections:解决mysql连接数过多的问题
- 记一次hibernate一对多问题的解决
- go语言 Accept error: accept tcp [::]:5551: too many open files;
- too many connections错误
- MySQL客户端连接时 MySql Host is blocked because of many.
- Too many classes in --main-dex-list
- django多对多关联表的操作
- Too many processes on Zabbix server 解决办法