最短路水题= = PKU1125
来源:互联网 发布:香港网络 编辑:程序博客网 时间:2024/05/16 07:36
//最短路的水题。= =#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 999999int 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[N];}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: 10000KTotal Submissions: 27209 Accepted: 15082
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
0 0
- 最短路水题= = PKU1125
- 最短路水题
- 最短路水题
- 最短路水题
- PKU1125 最短路径 Floyd-Warshall算法
- hdu3665Seaside 最短路水题
- poj2253Frogger 最短路水题
- POJ3268最短路水题
- poj 2387 Til the Cows Come Home(最短路水题 = =)
- POJ2485 最短路的水题
- POJ 1502 Dijkstra最短路水题
- UVA 567 最短路水题
- hdu 2066 最短路水题
- poj 2387 最短路水题
- POJ 1125 最短路的水题
- hdu3665 水最短路
- 最短路题集
- 最短路三水题
- 华为机试练习---java实现电话号码本
- 数据库学习--mysql语句汇总
- 深入JVM锁机制1-synchronized .
- phonegap打包apk
- BNUOJ 34990 北京邀请赛最后一题
- 最短路水题= = PKU1125
- C#开源系统大汇总
- android SDK adb命令入门学习
- 使用GCD
- 黑马程序员25——OC之内存管理(autorelease)
- HDU 1587 Flowers【简单题】
- 程序员必备的网站
- Android原生拼音输入法分析
- JAVA的StringBuffer类