poj 1502 MPI Maelstrom

原创 2013年12月03日 20:12:30

MPI Maelstrom

Time Limit: 1000MS


Memory Limit: 10000K

Total Submissions: 2367


Accepted: 1390


BIT has recently takendelivery of their new supercomputer, a 32 processor Apollo Odyssey distributedshared memory machine with a hierarchical communication subsystem. ValentineMcKee's research advisor, Jack Swigert, has asked her to benchmark the newsystem. 
``Since the Apollo is a distributed shared memory machine, memory access andcommunication times are not uniform,'' Valentine told Swigert. ``Communicationis fast between processors that share the same memory subsystem, but it isslower between processors that are not on the same subsystem. Communicationbetween 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 oneprocessor to all the other n-1 processors, they just do a sequence of n-1sends. 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 themessage to another, those two can then send messages to two other hosts at thesame 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 networkthat we should exploit. The interface cards we have allow each processor tosimultaneously send messages to any number of the other processors connected toit. However, the messages don't necessarily arrive at the destinations at thesame time -- there is a communication cost involved. In general, we need totake into account the communication costs for each link in our networktopologies and plan accordingly to minimize the total time required to do abroadcast.''


The input will describethe topology of a network connecting n processors. The first line of the inputwill be n, the number of processors, such that 1 <= n <= 100. 

The rest of the input defines an adjacency matrix, A. The adjacency matrix issquare and of size n x n. Each of its entries will be either an integer or thecharacter x. The value of A(i,j) indicates the expense of sending a messagedirectly from node i to node j. A value of x for A(i,j) indicates that amessage cannot be sent directly from node i to node j. 

Note that for a node to send a message to itself does not require networkcommunication, so A(i,i) = 0 for 1 <= i <= n. Also, you may assume thatthe 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) lowertriangular 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 willcontain two entries, A(3,1) and A(3,2), and so on.


Your program shouldoutput the minimum communication time required to broadcast a message from thefirst processor to all the other processors.

Sample Input



30 5

100 20 50

10 x x 10

Sample Output


题目就是Dijkstra算法题, 题意就是求第一个点到各个点最短路径中的最大值。


atof()             将字符串转换成浮点数值 
atoi()                 将字符串转换成整数值 
atol()                 将字符串转换成长整数值 
strtod()             将字符串转换成双精度型数值 
strtol()             将字符串转换成长型数值 

输入的时候需要用到的小技巧,直接调用void dijkstra()就可以 了。。。











using namespace std;

# define INF  999999999;

const int maxn=1000;


bool v[maxn];

char t[maxn];

int min(int a,intb){

    return a<b?a:b;



int main(){


         for(int i=1;i<=n;i++){

            for(int j=1;j<=n;j++){











         for(int i=2;i<=n;i++){

            for(int j=1;j<=i-1;j++){







                   g[j][i]=atoi(t);  // atoi();将字符串转为整型。






         for(int i=1;i<=n;i++){




         memset(v,0,sizeof v);

         for(int i=1;i<=n;i++){

            int mark=-1,mindis=INF;

            for(int j=1;j<=n;j++){







            for(int j=1;j<=n;j++){







         /*for(int j=1;j<=n;j++){



         int themax=0;

         for(int j=2;j<=n;j++){









MPI Maelstrom(poj1502)(迪杰斯特拉+atoi函数)

MPI Maelstrom Time Limit: 1000MS   Memory Limit: 10000K Total Submissions: 5637   Accepted: 35...

POJ1502_MPI Maelstrom_最短路::朴素的dijkstra

MPI Maelstrom Time Limit: 1000MS   Memory Limit: 10000K Total Submissions: 9173   Accepted: 56...
  • yuege38
  • yuege38
  • 2017年03月13日 21:00
  • 128

POJ 1502 MPI Maelstrom(Dijkstra)

POJ 1502 MPI Maelstrom(Dijkstra) http://poj.org/problem?id=1502 题意: (整个第一段题意描述都是无关的话,可以直接看input)题目的输...

POJ 1502 MPI Maelstrom

poj ACM 最短路径

最短路spfa POJ 1502 MPI Maelstrom

最短路 spfa POJ 1502 MPI Maelstrom

poj 1502 MPI Maelstrom

题目链接 http://poj.org/problem?id=1502 题目大意:求最短路,样例解释,给的是邻接矩阵的下半部分。 思路:根据题目给的一半邻接矩阵构图,然后直接dijkstra...
  • shhyzzu
  • shhyzzu
  • 2016年03月15日 21:12
  • 107

POJ - 1502 MPI Maelstrom Dijkstra

思路:直接Dijkstra,求源点1到其他各点的最短距离的最大值。 AC代码 #include #include #include #include #include #include ...

POJ1502 MPI Maelstrom(最短路径)

题意: 邻接矩阵表示一个无向图,因此只给一半,x代表无法从i到j。 要点: 最短路径水题,用dijkstra直接过了,现在主要是练习一下bellman-ford算法和spfa算法。 dijkstr...

POJ【1502】MPI Maelstrom

MPI Maelstrom Time Limit: 1000MS   Memory Limit: 10000KB   64bit IO Format: %I64d & %...

【POJ】1502 MPI Maelstrom 最短路

传送门:【POJ】1502 MPI Maelstrom 题目分析:英语捉急了,题目超级简单。。...
您举报文章:poj 1502 MPI Maelstrom