# POJ 1125 Stockbroker Grapevine【floyd】

Stockbroker Grapevine

 Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 33381 Accepted: 18392

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

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

AC代码：

#include<stdio.h>
#include<string.h>
#include<iostream>
using namespace std;
int map[1000][1000];
int main()
{
int n;
while(~scanf("%d",&n))
{
if(n==0)break;
for(int i=0;i<n;i++)
{
for(int j=0;j<n;j++)
{
map[i][j]=0x3f3f3f3f;
}
}
for(int i=0;i<n;i++)
{
int k;
scanf("%d",&k);
for(int j=0;j<k;j++)
{
int to,val;
scanf("%d%d",&to,&val);
to--;
map[i][to]=min(map[i][to],val);
}
}
for(int i=0;i<n;i++)
{
for(int j=0;j<n;j++)
{
for(int k=0;k<n;k++)
{
map[j][k]=min(map[j][k],map[j][i]+map[i][k]);
}
}
}
int pos=-1;
int ans=0x3f3f3f3f;
for(int i=0;i<n;i++)
{
int judge=1;
int output=-0x3f3f3f3f;
for(int j=0;j<n;j++)
{
if(i==j)continue;
if(map[i][j]==0x3f3f3f3f)
{
judge=0;
break;
}
output=max(output,map[i][j]);
}
if(judge==1)
{
if(ans>output)
{
ans=output;
pos=i;
}
}
}
if(pos==-1)
{
printf("disjoint\n");
continue;
}
printf("%d %d\n",pos+1,ans);
}
}


• 本文已收录于以下专栏：

## POJ 1125-Stockbroker Grapevine(floyd)

E - Stockbroker Grapevine Time Limit:1000MS     Memory Limit:10000KB     64bit IO Format:%I64d ...

## POJ 1125 Stockbroker Grapevine Floyd算法

//  Floyd算法 #include #include #include int map[102][102]; int mx[102]; int main() { int n; w...

Floyd算法解决

## Poj 1125 Stockbroker Grapevine(floyd小变形)

Stockbroker Grapevine Time Limit: 1000MS   Memory Limit: 10000K Total Submissions:...

## poj1125Stockbroker Grapevine - floyd最短路

poj1125Stockbroker Grapevine 题目生词比较多... 翻译如下： http://poj.org/showmessage?message_id=162255 首先，...

## POJ 1125 Stockbroker Grapevine(Floyd)

POJ 1125 Stockbroker Grapevine(Floyd) http://poj.org/problem?id=1125 题意:给你一个有向图,现在要你找一个起点来传播消息,问你要找那...

## POJ 1125 Stockbroker Grapevine Floyd 最短路

#include #include #include #include #include #include #include #include #include #include ...

## POJ 1125 Stockbroker Grapevine 【最短路（Floyd算法）】

Description Stockbrokers are known to overreact to rumours. You have been contracted to develop a me...

举报原因： 您举报文章：深度学习：神经网络中的前向传播和反向传播算法推导 色情 政治 抄袭 广告 招聘 骂人 其他 (最多只允许输入30个字)