Stockbroker Grapevine
Time Limit: 1000MS | Memory Limit: 10000K | |
Total Submissions: 33888 | Accepted: 18730 |
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
题目描述:
你散播一个谣言,但是股票经纪人只相信他们信得过的人,给你股票经纪人的数量,并且给出每个股票经纪人信得过的人数,和散播给每个人所需要的时间要你求得最快使所有人听到谣言的起点和使所有人听到谣言的最短时间。
解题思路:
使所有人听到谣言的最短时间为最后一个人听到的时间,先用SPFA算法获得单源最短路径数组,每次获取最慢的时间(最后一个人听到)
此时的起点就是最快使所有人听到谣言的起点
//head.h
#include <cstdio> #include <cstring> #include <cstdlib> #include <iostream> #include <cmath> #include <ctime> #include <algorithm> #include <string> #include <memory> #include <string> #include <list> #include <queue> #include <deque> #include <vector> #include <stack> #include <utility> #include <set> #include <map> #include <iterator> #include <fstream> #define LOCAL #ifndef LOCAL #include "head.h" #endif using namespace std; const int maxe = 10000; const int maxp = 100000; const int oo = 1000000; struct Edge{ int next; int cost; Edge(int next,int cost):next(next),cost(cost){} }; int n,m; vector<Edge> G[maxe]; bool flag[maxp]; int dist[maxp]; int SPFA(int st)//起点 { queue<int> q; memset(flag,0,maxp); memset(dist,oo,maxp); q.push(st); flag[st]=1;//入队 dist[st]=0;//出发点到自身路径的长度为0 while(!q.empty()) { const int now = q.front();//当前没处理的点 flag[now]=0;//将该点拿出队列 q.pop(); for(int k = 0;k < G[now].size();++ k) { Edge e = G[now][k];//取得节点 if(dist[now]+e.cost < dist[e.next]) { dist[e.next] = dist[now]+e.cost; if(!flag[e.next])//若未在处理队列中 { q.push(e.next); flag[e.next]=1;//入队 } } } } int ans = -oo; for(int i = 1;i <= n;++ i) ans = max(ans,dist[i]); return ans; } int main() { int v; //freopen("data1125.in","r",stdin); while(scanf("%d",&n),n) { for(int i = 1;i <= n;++ i) G[i].clear(); for(int v = 1;v <= n;++ v) { scanf("%d",&m); int to,cost; while(m--) { scanf("%d%d",&to,&cost); G[v].push_back(Edge(to,cost)); } } int st; int mincost=oo; for(int d = 1;d <= n;++ d) { int tmp = SPFA(d); if(mincost>tmp) { mincost = tmp; st=d; } } if(mincost==oo) printf("disjoint\n"); else printf("%d %d\n",st,mincost); } return 0; }