Stockbroker Grapevine
来源:互联网 发布:2016最新网络歌曲 编辑:程序博客网 时间:2024/06/09 16:50
Stockbroker Grapevine
Time Limit: 1000MS Memory Limit: 10000KTotal Submissions: 26912 Accepted: 14903
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
题意:股市中小道消息的传递,股市中的stockbrokers有股市的信息,通过他可以发出消息传递给其他所有人(可以间接传递)
给出每个stockbroker可以直接接触的人和传递消息给他所需时间。
求:从哪个stockbroker传递的消息能再最短时间内使所有人都得到。
思路:用Floyd解之。
第一次做,几乎是套用模板:
#include<cstdio>#include<cstring>#define MIN 100000000#define max(a,b) a>b?a:bint d[110][110];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(d[j][i]!=MIN && d[i][k]!=MIN && d[j][k]>d[j][i]+d[i][k] ) { d[j][k]=d[j][i]+d[i][k]; } } }int main(){ int i,j,n,m,a,b,sum,min,pos; while(scanf("%d",&n)&&n) { for(i=0;i<=n;i++) for(j=0;j<=n;j++) d[i][j]=MIN; for(i=1;i<=n;i++) { scanf("%d",&m); while(m--) { scanf("%d%d",&a,&b); d[i][a]=b; } } floyd(n); min=MIN; for(i=1;i<=n;i++) { sum=-1; for(j=1;j<=n;j++) { if(i==j) continue; sum=max(sum,d[i][j]); } if(sum<min) { min=sum; pos=i; } } if(min>=MIN) printf("disjoint\n"); else printf("%d %d\n",pos,min); } return 0;}
0 0
- stockbroker grapevine
- Stockbroker Grapevine
- Stockbroker Grapevine
- Stockbroker Grapevine
- Stockbroker Grapevine
- Stockbroker Grapevine
- Stockbroker Grapevine
- zoj1082 Stockbroker Grapevine
- POJ1125 Stockbroker Grapevine
- JOJ 1002 Stockbroker Grapevine
- POJ1125 Stockbroker Grapevine
- 1125Stockbroker Grapevine
- pku1125 Stockbroker Grapevine
- zoj1082 Stockbroker Grapevine
- [joj]Stockbroker Grapevine (1002)
- JOJ1002: Stockbroker Grapevine
- poj 1125 Stockbroker Grapevine
- POJ 1125 Stockbroker Grapevine
- HDU4941Magical Forest(map)
- hbase scan 类
- 6.2.8 In Action
- hdu-oj 1219 AC Me
- 记录一个程序中的小bug,关于GUI的JTable组件
- Stockbroker Grapevine
- hdu 1051(贪心算法)
- hbase filter类
- Rage(PC) Modding Notes : Console Commands
- 关于热更新的东西
- POJ训练计划2777_Count Color(线段树/成段更新/区间染色)
- IBM MQ 学习(一)
- hdu 4944 FSF’s game(数论)
- 机房收费系统之报表(二)