最短路练习7/poj/1502 /MPI Maelstrom/方法:floyd和Dijkstra
来源:互联网 发布:堕落天使知乎 编辑:程序博客网 时间:2024/06/05 17:23
题目链接:http://poj.org/problem?id=1502
MPI Maelstrom
Time Limit: 1000MS Memory Limit: 10000KTotal Submissions: 9384 Accepted: 5743
Description
BIT has recently taken delivery of their new supercomputer, a 32 processor Apollo Odyssey distributed shared memory machine with a hierarchical communication subsystem. Valentine McKee's research advisor, Jack Swigert, has asked her to benchmark the new system.
``Since the Apollo is a distributed shared memory machine, memory access and communication times are not uniform,'' Valentine told Swigert. ``Communication is fast between processors that share the same memory subsystem, but it is slower between processors that are not on the same subsystem. Communication between the Apollo and machines in our lab is slower yet.''
``How is Apollo's port of the Message Passing Interface (MPI) working out?'' Swigert asked.
``Not so well,'' Valentine replied. ``To do a broadcast of a message from one processor to all the other n-1 processors, they just do a sequence of n-1 sends. That really serializes things and kills the performance.''
``Is there anything you can do to fix that?''
``Yes,'' smiled Valentine. ``There is. Once the first processor has sent the message to another, those two can then send messages to two other hosts at the same time. Then there will be four hosts that can send, and so on.''
``Ah, so you can do the broadcast as a binary tree!''
``Not really a binary tree -- there are some particular features of our network that we should exploit. The interface cards we have allow each processor to simultaneously send messages to any number of the other processors connected to it. However, the messages don't necessarily arrive at the destinations at the same time -- there is a communication cost involved. In general, we need to take into account the communication costs for each link in our network topologies and plan accordingly to minimize the total time required to do a broadcast.''
``Since the Apollo is a distributed shared memory machine, memory access and communication times are not uniform,'' Valentine told Swigert. ``Communication is fast between processors that share the same memory subsystem, but it is slower between processors that are not on the same subsystem. Communication between the Apollo and machines in our lab is slower yet.''
``How is Apollo's port of the Message Passing Interface (MPI) working out?'' Swigert asked.
``Not so well,'' Valentine replied. ``To do a broadcast of a message from one processor to all the other n-1 processors, they just do a sequence of n-1 sends. That really serializes things and kills the performance.''
``Is there anything you can do to fix that?''
``Yes,'' smiled Valentine. ``There is. Once the first processor has sent the message to another, those two can then send messages to two other hosts at the same time. Then there will be four hosts that can send, and so on.''
``Ah, so you can do the broadcast as a binary tree!''
``Not really a binary tree -- there are some particular features of our network that we should exploit. The interface cards we have allow each processor to simultaneously send messages to any number of the other processors connected to it. However, the messages don't necessarily arrive at the destinations at the same time -- there is a communication cost involved. In general, we need to take into account the communication costs for each link in our network topologies and plan accordingly to minimize the total time required to do a broadcast.''
Input
The input will describe the topology of a network connecting n processors. The first line of the input will be n, the number of processors, such that 1 <= n <= 100.
The rest of the input defines an adjacency matrix, A. The adjacency matrix is square and of size n x n. Each of its entries will be either an integer or the character x. The value of A(i,j) indicates the expense of sending a message directly from node i to node j. A value of x for A(i,j) indicates that a message cannot be sent directly from node i to node j.
Note that for a node to send a message to itself does not require network communication, so A(i,i) = 0 for 1 <= i <= n. Also, you may assume that the network is undirected (messages can go in either direction with equal overhead), so that A(i,j) = A(j,i). Thus only the entries on the (strictly) lower triangular portion of A will be supplied.
The input to your program will be the lower triangular section of A. That is, the second line of input will contain one entry, A(2,1). The next line will contain two entries, A(3,1) and A(3,2), and so on.
The rest of the input defines an adjacency matrix, A. The adjacency matrix is square and of size n x n. Each of its entries will be either an integer or the character x. The value of A(i,j) indicates the expense of sending a message directly from node i to node j. A value of x for A(i,j) indicates that a message cannot be sent directly from node i to node j.
Note that for a node to send a message to itself does not require network communication, so A(i,i) = 0 for 1 <= i <= n. Also, you may assume that the network is undirected (messages can go in either direction with equal overhead), so that A(i,j) = A(j,i). Thus only the entries on the (strictly) lower triangular portion of A will be supplied.
The input to your program will be the lower triangular section of A. That is, the second line of input will contain one entry, A(2,1). The next line will contain two entries, A(3,1) and A(3,2), and so on.
Output
Your program should output the minimum communication time required to broadcast a message from the first processor to all the other processors.
Sample Input
55030 5100 20 5010 x x 10
Sample Output
35题意很简单:求所有点到点1的最短路的最大值。
方法一:Dijkstra:
#include<iostream>#include<cstdio>#include<cstdlib>#include<cstring>#include<algorithm>#include<cmath>#include<queue>#include<vector>#include<map>#include<string>#define LL long long#define eps 1e-8using namespace std;const int mod = 1e7+7;const int inf = 0x3f3f3f3f;const int maxn = 1e6 +10;int n;int ma[105][105];int dis[105];int vis[105];char a[15];int main(){ while(~scanf("%d",&n)) { memset(dis,inf,sizeof(dis)); memset(vis,0,sizeof(vis)); for(int i=2;i<=n;i++) { for(int j=1;j<i;j++) { int sum=0; scanf("%s",a); int la=strlen(a); if(a[0]=='x') sum=inf; if(a[0]!='x') for(int k=0;k<la;k++) sum=sum*10+a[k]-'0'; ma[j][i]=ma[i][j]=sum; } } for(int i=1;i<=n;i++) { ma[i][i]=0; dis[i]=ma[1][i]; } int nn=n-1; int ans=0; while(nn--) { int sum=inf,point =-1; for(int i=2;i<=n;i++) { if(!vis[i]&&dis[i]<sum) { sum=dis[i]; point=i; } } if(point !=-1) { vis[point]=1; ans=max(dis[point],ans); for(int i=2;i<=n;i++) { if(!vis[i]&&dis[point]+ma[point][i]<dis[i]) { dis[i]=dis[point ]+ma[point][i]; } } } } printf("%d\n",ans); }}
方法2:floyd:
#include<iostream>#include<cstdio>#include<cstdlib>#include<cstring>#include<algorithm>#include<cmath>#include<queue>#include<vector>#include<map>#include<string>#define LL long long#define eps 1e-8using namespace std;const int mod = 1e7+7;const int inf = 0x3f3f3f3f;const int maxn = 1e6 +10;int n;int ma[105][105];char a[15];int main(){ while(~scanf("%d",&n)) { for(int i=2;i<=n;i++) { for(int j=1;j<i;j++) { int sum=0; scanf("%s",a); int la=strlen(a); if(a[0]=='x') sum=inf; if(a[0]!='x') for(int k=0;k<la;k++) sum=sum*10+a[k]-'0'; ma[j][i]=ma[i][j]=sum; } } for(int i=1;i<=n;i++) ma[i][i]=0; for(int i=1;i<=n;i++) { for(int j=1;j<=n;j++) { for(int k=1;k<=n;k++) { if(ma[j][i]+ma[i][k]<ma[j][k]) ma[j][k]=ma[j][i]+ma[i][k]; } } } int ans=0; for(int i=1;i<=n;i++) ans=max(ans,ma[1][i]); printf("%d\n",ans); }}
0 0
- 最短路练习7/poj/1502 /MPI Maelstrom/方法:floyd和Dijkstra
- POJ 1502 MPI Maelstrom 最短路dijkstra
- POJ-1502-MPI Maelstrom [最短路][Dijkstra]
- POJ 1502 MPI Maelstrom 单源最短路 Floyd Dijkstra
- poj 1502--MPI Maelstrom (最短路spfa)
- 【POJ】1502 MPI Maelstrom 最短路
- POJ 1502 MPI Maelstrom(最短路)
- POJ 1502 MPI Maelstrom 最短路
- POJ 1502MPI Maelstrom BFS最短路
- poj 1502 MPI Maelstrom(最短路)
- 最短路spfa POJ 1502 MPI Maelstrom
- POJ 1502 MPI Maelstrom最短路问题
- POJ 1502 MPI Maelstrom【最短路】
- POJ 1502 MPI Maelstrom 最短路
- POJ--1502:MPI Maelstrom (最短路径:Dijkstra算法 & Floyd算法)
- POJ 1502 MPI Maelstrom(单源最短路|Floyd实现)
- POJ1502 MPI Maelstrom(最短路dijkstra)
- POJ1502 MPI Maelstrom(dijkstra,最短路)
- git bash的一些基础操作
- ubuntu下搜狗输入法的输入框只显示英文不显示中文的问题
- JAVA多线程和并发基础面试题
- 容器Cgroup和Namespace特性简介
- 数组名与指针“没关系”
- 最短路练习7/poj/1502 /MPI Maelstrom/方法:floyd和Dijkstra
- http-关于application/x-www-form-urlencoded等字符编码的解释说明
- COM基础知识
- Sass:初识Sass与Koala工具的使用
- Http协议
- java 输入n行n列的星号
- try后的finally{}里面的code的执行
- android服务
- 有用的技术网站