poj 1125 Stockbroker Grapevine——Floyd-Warshall算法
来源:互联网 发布:流动人口数据在哪里 编辑:程序博客网 时间:2024/06/04 22:47
Stockbroker Grapevine
Time Limit: 1000MS Memory Limit: 10000KTotal Submissions: 24476 Accepted: 13468
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.
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.
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.
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
32 2 4 3 52 1 2 3 62 1 2 2 253 4 4 2 8 5 31 5 84 1 6 4 10 2 7 5 202 2 5 1 50
Sample Output
3 23 10
#include <iostream>using namespace std;int dis[105][105];void Floyd(int n){ int i,j,k; for(i=1;i<=n;i++) for(j=1;j<=n;j++) for(k=1;k<=n;k++) if(dis[j][i]+dis[i][k]<dis[j][k]){ dis[j][k]=dis[j][i]+dis[i][k]; }}void Min(int n){ int node,min=0xfffff; int i,j; for(i=1;i<=n;i++){ int max=0; for(j=1;j<=n;j++){ if(i==j) continue; if(dis[i][j]>max) max=dis[i][j]; } if(max<min){ min=max; node=i; } } if(min<0xffff){ printf("%d %d\n",node,min); } else{ printf("disjoint\n"); }}int main(){ int n,i,j,k,m; while(scanf("%d",&n)&&n){ for(i=1;i<=n;i++){ for(j=1;j<=n;j++){ dis[i][j]=0xfffff; } } for(i=1;i<=n;i++){ scanf("%d",&m); for(j=0;j<m;j++){ scanf("%d",&k); scanf("%d",&dis[i][k]); } } Floyd(n); Min(n); } return 0;}
0 0
- poj 1125 Stockbroker Grapevine——Floyd-Warshall算法
- POJ 1125 Stockbroker Grapevine(求最短路径—Floyd算法)
- poj 1125 Stockbroker Grapevine——Floyd
- POJ 1125 Stockbroker Grapevine (最短路径.Floyd-Warshall)
- poj 1125Stockbroker Grapevine水题Floyd算法
- POJ 1125 floyd算法 Stockbroker Grapevine
- POJ 1125 Stockbroker Grapevine Floyd算法
- POJ 1125 Stockbroker Grapevine //Floyd算法
- POJ 1125 Stockbroker Grapevine(Floyd算法)
- POJ 1125 Stockbroker Grapevine (Floyd算法)
- POJ 1125 Stockbroker Grapevine(floyd算法)
- pku 1125 Stockbroker Grapevine(Floyd-Warshall)
- POJ 1125 Stockbroker Grapevine (Floyd)
- poj 1125Stockbroker Grapevine(Floyd)
- POJ 1125 Stockbroker Grapevine Floyd
- POJ 1125 Stockbroker Grapevine (Floyd)
- POJ 1125 Stockbroker Grapevine(Floyd)
- [floyd]POJ 1125 Stockbroker Grapevine
- 二叉树的深度遍历
- NIO —— 缓冲区Buffer
- Hadoop——你不得不了解的大数据工具
- 设计模式学习笔记——适配器模式
- 基于win 7 的vs2010下安装directshow 需要卸载vc++ 2010 Redistributable
- poj 1125 Stockbroker Grapevine——Floyd-Warshall算法
- jsp相关笔记
- 航空机场三字码和航空公司二字码
- CAIDA midar 安装过程
- Qt5.2 for Android 配置及部署到手机运行
- Putting Spark to Use: Fast In-Memory Computing for Your Big Data Applications
- setTimeZone
- 有趣的指针
- 用百度地图API打造方便自己使用的手机地图