poj_1125 Stockbroker Grapevine(floyd)
来源:互联网 发布:php 电商系统 编辑:程序博客网 时间:2024/06/07 02:46
Stockbroker Grapevine
Time Limit: 1000MS Memory Limit: 10000KTotal Submissions: 34651 Accepted: 19210
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
用floyd算出每对顶点之间的最短路,之后算出每个顶点到其他顶点的最短路 中的最长路径。最后找出最长路径中的最小值。
#include <iostream>#include <cstdio>#include <cstdlib>#include <cstring>#include <cmath>#include <stack>#include <bitset>#include <queue>#include <set>#include <map>#include <string>#include <algorithm>#define FOP freopen("data.txt","r",stdin)#define inf 0x3f3f3f3f#define maxn 110#define mod 1000000007#define PI acos(-1.0)#define LL long longusing namespace std;int edge[maxn][maxn];int n;void floyd(){ int t; for(int k = 1; k <= n; k++) { for(int i = 1; i <= n; i++) { for(int j = 1; j <= n; j++) { t = edge[i][k] + edge[k][j]; if(edge[i][j] > t) edge[i][j] = t; } } }}int main(){ while(scanf("%d", &n) && n) { for(int i = 1; i <= n; i++) { for(int j = 1; j < i; j++) { edge[i][j] = inf; edge[j][i] = inf; } } int m, b, c; for(int i = 1; i <= n; i++) { scanf("%d", &m); for(int j = 1; j <= m; j++) { scanf("%d%d", &b, &c); edge[i][b] = c; } } floyd(); int ansi = 0; int ans = inf; for(int i = 1; i <= n; i++) { int t = 0; for(int j = 1; j <= n; j++) { if(edge[i][j] > t) t = edge[i][j]; } if(ans > t) ansi = i, ans = t; } if(ansi) printf("%d %d\n", ansi, ans); else printf("disjoint\n"); } return 0;}
0 0
- poj_1125 Stockbroker Grapevine(floyd)
- poj_1125 Stockbroker Grapevine
- POJ_1125 Stockbroker Grapevine
- [POJ_1125]Stockbroker Grapevine
- POJ_1125(folyd算法)Stockbroker Grapevine
- POJ1125 Stockbroker Grapevine 【Floyd】
- POJ1125 Stockbroker Grapevine【Floyd】
- [floyd]poj1125 Stockbroker Grapevine
- poj1125 Stockbroker Grapevine (Floyd)
- POJ 1125 Stockbroker Grapevine (Floyd)
- poj 1125Stockbroker Grapevine(Floyd)
- POJ 1125 Stockbroker Grapevine Floyd
- POJ 1125 Stockbroker Grapevine (Floyd)
- poj1125--Stockbroker Grapevine--Floyd算法
- POJ1125《Stockbroker Grapevine》方法:Floyd
- POJ 1125 Stockbroker Grapevine(Floyd)
- [floyd]POJ 1125 Stockbroker Grapevine
- POJ 1125 Stockbroker Grapevine (Floyd)
- 广度优先搜索遍历(BFS)
- 【TextView】Android TextView显示省略号的问题(关于TextView maxLength 和maxEms的学习)
- IFileSinkFilter 接口
- mac 下Android studio 中Terminal执行adb命令
- Java多线程--对象及变量的并发访问
- poj_1125 Stockbroker Grapevine(floyd)
- IFilterGraph接口
- spring注解配置<mvc:annotation-driven />与<context:annotation-config />区别
- 取得yum install下载的安装包
- 数字证书原理(ssl,https)
- (一)Linux shell常见命令操作以及问题解决
- C/C++ Windows API——注册表
- 牛客网-二叉搜索树转换成一个排序的双向链表
- 特征值与特征向量