Stockbroker Grapevine
Time Limit: 1000MS | Memory Limit: 10000K | |
Total Submissions: 22887 | Accepted: 12487 |
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
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
11
题意:经纪人与经纪人之间相互传递谣言,两个经纪人之间传递需要代价,求从谁开始传递谣言,使得谣言使用的代价最少。
思路:floyd算法求出两两经纪人之间的最短路径,然后从每个经纪人出发作为源点...求出最长路径且能够遍历所有经纪人的所有路径中的话费代价最小路径。
具体代码:
/*
floyd先寻找任一点之间的最短路径,并保存路径,再遍历所以节点作为源点的最长路径的最小值保存下来...
从保存下来的数据找出最小值...
如果大于或等于定义点的MAX初始化值... 输出 disjoint 否则输出答案
*/
#include<iostream>
using namespace std;
#define MAX 105
#define MAXDIST 9999999
int dist[MAX][MAX]; //dist存储floyd之后两点之间最短路径
int n;
void floyd()
{
int k, i, j;
for(k = 1; k <= n; k++)
for(i = 1; i <= n; i++)
for(j = 1; j <= n; j++)
if(dist[i][j] > dist[i][k] + dist[k][j])
dist[i][j] = dist[i][k] + dist[k][j]; //坑爹的一开始这里打错了一个字母!!!!弄了我两个小时....调试才是最好的检错啊...
}
int main()
{
int i,j,num,dis,mint,res;
int maxlen[MAX];
while(cin >> n)
{
if(0 == n)
break;
//初始化
for(i = 1; i <= n; i++)
{
for(j = 1; j <= n; j++)
{
dist[i][j] = MAXDIST;
}
}
//路径输入
for(i = 1; i <= n; i++)
{
cin >> num;
while(num--)
{
cin >> j >> dis;
dist[i][j] = dis;
}
}
//floyd
floyd();
//找所有源点的最长路径
for(i = 1; i <= n; i++)
{
maxlen[i] = 0;
for(j = 1; j <= n; j++)
{
if(i == j)
continue;
if(maxlen[i] < dist[i][j])
maxlen[i] = dist[i][j];
//从最长路径中找出最小值
mint = MAXDIST;
for(i = 1; i <= n; i++)
{
if(maxlen[i] < mint)
{
mint = maxlen[i];
res = i;
}
}
//输出
if(mint == MAXDIST)
cout << "disjoint" << endl;
else
cout << res << " " << mint << endl;
}
return 0;
}