POJ 1125 Floyd
来源:互联网 发布:印度对中国的看法 知乎 编辑:程序博客网 时间:2024/06/03 03:56
Stockbroker Grapevine
Time Limit: 1000MS Memory Limit: 10000K
Total Submissions: 27978 Accepted: 15528
Description
Stockbrokers are known to overreact to rumours. You have been contracted to develop a method of spreading disinformation amongst the stockbrokers to give your employer the tactical edge in the stock market. For maximum effect, you have to spread the rumours in the fastest possible way.
Unfortunately for you, stockbrokers only trust information coming from their "Trusted sources" This means you have to take into account the structure of their contacts when starting a rumour. It takes a certain amount of time for a specific stockbroker to pass the rumour on to each of his colleagues. Your task will be to write a program that tells you which stockbroker to choose as your starting point for the rumour, as well as the time it will take for the rumour to spread throughout the stockbroker community. This duration is measured as the time needed for the last person to receive the information.
Input
Your program will input data for different sets of stockbrokers. Each set starts with a line with the number of stockbrokers. Following this is a line for each stockbroker which contains the number of people who they have contact with, who these people are, and the time taken for them to pass the message to each person. The format of each stockbroker line is as follows: The line starts with the number of contacts (n), followed by n pairs of integers, one pair for each contact. Each pair lists first a number referring to the contact (e.g. a '1' means person number one in the set), followed by the time in minutes taken to pass a message to that person. There are no special punctuation symbols or spacing rules.
Each person is numbered 1 through to the number of stockbrokers. The time taken to pass the message on will be between 1 and 10 minutes (inclusive), and the number of contacts will range between 0 and one less than the number of stockbrokers. The number of stockbrokers will range from 1 to 100. The input is terminated by a set of stockbrokers containing 0 (zero) people.
Output
For each set of data, your program must output a single line containing the person who results in the fastest message transmission, and how long before the last person will receive any given message after you give it to this person, measured in integer minutes.
It is possible that your program will receive a network of connections that excludes some persons, i.e. some people may be unreachable. If your program detects such a broken network, simply output the message "disjoint". Note that the time taken to pass the message from person A to person B is not necessarily the same as the time taken to pass it from B to A, if such transmission is possible at all.
Sample Input
3
2 2 4 3 5
2 1 2 3 6
2 1 2 2 2
5
3 4 4 2 8 5 3
1 5 8
4 1 6 4 10 2 7 5 2
0
2 2 5 1 5
0
Sample Output
3 2
3 10
Source
Southern African 2001
在运用Floyd算法求解任意两点之间的最短路时,一点要把探位点放在最前面:
for(int k=1;k<=n;k++)for(int i=1;i<=n;i++)
for(int j=1;j<=n;j++)
cost[i][j]=min(cost[i][j],cost[i][k]+cost[k][j];
/*Source CodeProblem: 1125User: X2012302616Memory: 680KTime: 0MSLanguage: G++Result: Accepted Source Code*/ #include<iostream> #include<cstdio> #include<cstring> #include<algorithm> using namespace std; int n; const int inf=0x3ffffff; int cost[107][107]; int ans,ans_source; void floyd() { for(int k=1;k<=n;k++) for(int i=1;i<=n;i++) for(int j=1;j<=n;j++) { if(i!=j&&cost[i][j]>cost[i][k]+cost[k][j]) cost[i][j]=cost[i][k]+cost[k][j]; } ans=inf;int sum=0; for(int i=1;i<=n;i++) { sum=0; for(int j=1;j<=n;j++) { if(i!=j&&cost[i][j]>sum) sum=cost[i][j]; } if(ans>sum){ ans=sum; ans_source=i; } } } int main() { // freopen("in.txt","r",stdin); int m,a,b; while(1){ scanf("%d",&n); if(n==0) break; //memset(cost,0,sizeof(cost)); for(int i=0;i<=n;i++) for(int j=0;j<=n;j++) cost[i][j]=inf; for(int i=1;i<=n;i++) { //cost[i][i]=0; scanf("%d",&m); for(int j=1;j<=m;j++) { scanf("%d%d",&a,&b); cost[i][a]=b; } } floyd(); if(ans<inf) printf("%d %d\n",ans_source,ans); else printf("disjoint\n"); } return 0; }
- poj 1125 floyd算法
- POJ 1125 Frogger (Floyd)
- POJ 1125 floyd水题
- POJ-1125 FLOYD
- POJ 1125 floyd算法
- poj 1125(floyd)
- POJ 1125 Floyd
- POJ 1125(Floyd)
- poj 1125 基础Floyd
- poj 1125&&zoj1082 floyd
- poj 1125 floyd
- POJ 1125 Floyd
- poj 1125 floyd
- poj 1125 Floyd
- poj 1125 floyd
- poj 1125 Floyd算法
- poj 1125 Floyd
- Floyd 算法 POJ 1125
- Android中Context详解——你所不知道的Context
- cocos2d-x-3.3rc2 动作管理 ActionManager
- Asp.net MVC中的ViewData与ViewBag
- 关注上帝的所想所爱,创造无限财富
- 如何用英文说明一种方法的优缺点(优点和缺点)
- POJ 1125 Floyd
- 使用Eclipse Memory Analyzer进行内存泄漏分析三部曲
- NSObject的常见方法
- RecyccleView 详解
- 肉鸡美眉跨平台DDoS组织
- 点击UITableView的cell展开收缩
- 《MonkeyRunner 原理剖析》第九章-MonkeyImage 实现原理 - 第一节 - 关键类作用及关系
- JabRef中文手册
- c++中.dll与.lib文件的生成与使用的详解