最短路水题= = PKU1125
2014-09-03 22:13
225 查看
//最短路的水题。= = #include <stdio.h> #include <stdlib.h> #include <malloc.h> #include <limits.h> #include <ctype.h> #include <math.h> #include <string.h> #include <string> #include <algorithm> #include <iostream> #include <stack> #include <queue> #include <deque> #include <set> #include <map> using namespace std; #define MAXN 100 + 10 #define INF 999999 int dis[MAXN]; int val[MAXN][MAXN]; int vis[MAXN]; int N; int sum[MAXN]; int mark[MAXN]; int Dijstkra(int s){ int i,j,min,pos; memset(vis,0,sizeof(vis)); memset(dis,0,sizeof(dis)); memset(sum,0,sizeof(sum)); for(i=1;i<=N;i++){ dis[i] = val[s][i]; } vis[s] = 1; dis[s] = 0; for(i=1;i<=N;i++){ min = INF; for(j=1;j<=N;j++){ if(!vis[j] && min>dis[j]){ pos = j; min = dis[j]; } } vis[pos] = 1; for(j=1;j<=N;j++){ if(!vis[j] && dis[j]>(dis[pos]+val[pos][j])){ dis[j] = dis[pos] + val[pos][j]; } } } sort(dis,dis+1+N); return dis ; } int main(){ int i,n,j; int end,cost; while(~scanf("%d",&N)){ if(N == 0){ break; } //memset(a,0,sizeof(a)); memset(mark,0,sizeof(mark)); for(i=1;i<=N;i++){ for(j=1;j<=N;j++){ val[i][j] = INF; } val[i][i] = 0; } for(j=1;j<=N;j++){ scanf("%d",&n); if(n == 0){ mark[j] = 1; continue; } for(i=1;i<=n;i++){ scanf("%d%d",&end,&cost); if(val[j][end] > cost){ val[j][end] = cost; } } } int ans1 = 0; int ans2 = INF; int flag; for(i=1;i<=N;i++){ if(mark[i] == 1){ continue; } flag = Dijstkra(i); if(flag < ans2){ ans2 = flag; ans1 = i; } } if(ans2 == INF){ printf("disjoint\n"); } else{ printf("%d %d\n",ans1,ans2); } } return 0; }
原题http://poj.org/problem?id=1125
Stockbroker Grapevine
Time Limit: 1000MS | Memory Limit: 10000K | |
Total Submissions: 27209 | Accepted: 15082 |
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
相关文章推荐
- pku1125 Floyd求每两点间的最短路
- POJ 1125 最短路的水题
- POJ 1125 Stockbroker Grapevine 最短路水题floyd || dijkstra
- (最短路-floyd+邻接矩阵)PKU-1125 Stockbroker Grapevine
- 多源最短路pku1125
- pku 1125 Stockbroker Grapevine 第一周训练——最短路
- poj 1125 Stockbroker Grapevine(多源最短路)
- HDU-2544 最短路 水题一枚
- PKU ACM 1125
- [最短路spfa]pku1511-Invitation Cards
- POJ Stockbroker Grapevine 1125 多源最短路(Floyd)
- POJ 1125 - Stockbroker Grapevine(最短路`Floyd)
- POJ 1125 -- Stockbroker Grapevine (弗洛伊德最短路)
- PKU3463(Sightseeing)-最短路和次短路问题,dijkstra算法
- NYOJ 426 && poj 1125 最短路 DFS 判断联通 SPFA
- pku2418水题--学写AVL
- PKU 3613 Cow Relays (指定路径条数的最短路)
- poj 1125 Stockbroker Grapevine 【最短路 Floyd】
- poj 1125 图论最短路变形题
- [最短路]pku2387-Til the Cows Come Home