poj 1125 Stockbroker Grapevine
2016-05-23 21:03
423 查看
Stockbroker Grapevine
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
Sample Output
Source
Southern African 2001
图比较小,时间复杂度几乎没有任何要求;
用Floyd算法算出所有最短路后,再按源点统计答案即可;
Time Limit: 1000MS | Memory Limit: 10000K | |
Total Submissions: 33273 | Accepted: 18329 |
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算法算出所有最短路后,再按源点统计答案即可;
#include<iostream> #include<string> #include<algorithm> #include<cstring> using namespace std; const int inf=0x3f3f3f3f; int maze[101][101]; int n; void Floyd() { for(int k=1;k<=n;++k) for(int i=1;i<=n;++i) for(int j=1;j<=n;++j) maze[i][j]=min(maze[i][j],maze[i][k]+maze[k][j]); } int main() { ios_base::sync_with_stdio(false); cin.tie(0); while(cin>>n&&n) { memset(maze,inf,sizeof(maze)); int t,to,time; for(int i=1;i<=n;++i) { cin>>t; while(t--) { cin>>to>>time; maze[i][to]=time; } } Floyd(); int ans=inf,start; for(int i=1;i<=n;++i) { int temp=0; for(int j=1;j<=n;++j) { if(i==j) continue; else if(maze[i][j]>temp) { temp=maze[i][j]; } } if(temp<ans) { ans=temp; start=i; } } cout<<start<<" "<<ans<<endl; } return 0; }
相关文章推荐
- 2016"百度之星" - 初赛(Astar Round2A)HDU 5695 拓扑排序+优先队列
- eclipse tomcat add and remove工程异常
- 2012蓝桥杯决赛第一题
- 数据结构之排序算法的稳定性
- 团队第二次冲刺第一天
- 编译时出现的错误和解决办法
- ccache——/root/.ccache
- 一次解决OOM的经历
- 记一次事件委托在 ios 下的兼容 bug
- 数组去重
- 设计模式 - Template模式
- 城市交通_ssl1636_floyd
- android中使用flexboxlayout
- 排列组合公式 扳子
- hdoj2042不容易系列之二
- 标准文件与及其相关联的文件指针(等各项参数)
- 最长上升子序列优化算法 【算法作业】
- bzoj 3243: [Noi2013]向量内积 矩阵乘法
- 解决Gridview列表view高度无法固定的方法
- 高并发金融应用架构优化与平台创新