Stockbroker Grapevine
来源:互联网 发布:newsql数据库有哪些 编辑:程序博客网 时间:2024/06/09 17:02
Stockbroker Grapevine
Time Limit: 1000MS Memory Limit: 10000KTotal Submissions: 34790 Accepted: 19303
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
Source
Southern African 2001
#include<iostream>using namespace std;const int inf = (1 << 20);struct node{ int x,y,tm;};int dis[110][110];void floyd(int n){ for(int k = 0;k < n;k++) { for(int i = 0;i < n;i++) { for(int j = 0;j < n;j++) { if(dis[i][j] > dis[i][k] + dis[k][j]) { dis[i][j] = dis[i][k] + dis[k][j]; } } } }}void path(int n){ node ss,ee; ss.tm = inf; for(int i = 0;i < n;i++) { ee.tm = 0; for(int j = 0;j < n;j++) { if(ee.tm < dis[i][j]) { ee.tm = dis[i][j]; ee.x = i; ee.y = j; } } if(ss.tm > ee.tm) ss = ee; } if(ss.tm >= inf) cout << "disjoint" << endl; else cout << ss.x+1 << " " << ss.tm << endl;}int main(){ int n,m; while(cin >> n) { if(!n) break; for(int i = 0;i < 110;i++) { for(int j = 0;j < 110;j++) { if(i == j) dis[i][j] = 0; else dis[i][j] = inf; } } for(int i = 0;i < n;i++) { cin >> m; for(int j = 0;j < m;j++) { int a,b; cin >> a >> b; dis[i][a-1] = b; } } floyd(n); path(n); } 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
- jQuery内容过滤选择器
- 海洋CMS6.28命令执行漏洞
- 洛谷 P1134 阶乘问题
- 专题:计算几何学 (多边形的中心) hdu1115Lifting the Stone
- getContextPath、getServletPath、getRequestURI、getRealPath、getRequestURL、的区别
- Stockbroker Grapevine
- could not get lock /var/lib/dpkg/lock -open
- C#中的抽象类的特征
- Atitit 拦截数据库异常的处理最佳实践
- 薛开宇学习笔记二之总结笔记--caffe imagenet训练中train_val.prototxt中数据层及其参数设置
- fragment中嵌套viewpager,vierpager中有多个fragment,不显示 ...
- java jquery ajax Servlet jsp页面异步请求验证用户名
- RxPermissions源码分析:使用RxJava处理Android 6.0运行时动态权限获取
- Map解析