MPI Maelstrom

Time Limit : 2000/1000ms (Java/Other)   Memory Limit : 20000/10000K (Java/Other)
Total Submission(s) : 2   Accepted Submission(s) : 1
Problem 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.''

 
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. <br> <br>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. <br> <br>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. <br> <br>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
5
50
30 5
100 20 50
10 x x 10
 
Sample Output
35
题目大意:给你一个不完全的矩阵,数字表示权值,x表示两点间不可达
     由于自身到自身花费的时间为0,所以没有给出,由于i到j和j到i距离相同,互达时间相同
     所以只给出了一半的临界矩阵。
     根据给你的这个临界矩阵,让你来求从点1到其他点所花费最短时间集里面的的最大值。
     其实这是一个很直接的最短路
解题思路:特殊处理一下值为x的情况,建立邻接阵,运用单源最短路径算法求出第一个处理器到其他所有处理器的最短传递信息时间,
     然后取这些最短时间中的最大者即可。
AC代码:
 #include <stdio.h>
#include <string.h>
#define inf 9999999
int p[][];
int dis[];
int visit[];
int n;
void dijkstra() //模板
{
int i,j,pos,minn;
for (i = ; i <= n; i ++)
{
dis[i] = p[][i];
visit[i] = ;
}
dis[] = ; for (i = ; i <= n; i ++)
{
minn = inf;
for(j = ; j <= n; j ++)
{
if (!visit[j] && dis[j] < minn)
{
minn = dis[j];
pos = j;
}
}
visit[pos] = ;
for (j = ; j <= n; j ++)
{
if (!visit[j] && dis[j] > dis[pos]+p[pos][j])
dis[j] = dis[pos]+p[pos][j];
}
}
}
int change(char str[]) //处理输入数据
{
int i;
int ans = ;
for (i = ; str[i]; i ++)
ans = ans*+str[i]-'';
return ans;
}
int main ()
{
int i,j;
char str[];
while (~scanf("%d",&n))
{
for (i = ; i <= n; i ++)
for (j = ; j <= n; j ++)
if (i == j)
p[i][j] = ;
else
p[i][j] = inf; for (i = ; i <= n; i ++)
{
for (j = ; j < i; j ++)
{
scanf("%s",str); //将数据全存为字符型
if (str[] != 'x')
p[i][j] = p[j][i] = change(str);
}
} dijkstra();
int maxx = ;
for (i = ; i <= n; i ++)
{
if (dis[i] > maxx)
maxx = dis[i];
}
printf("%d\n",maxx);
}
return ;
}

POJ 1502 MPI Maelstrom的更多相关文章

  1. POJ 1502 MPI Maelstrom / UVA 432 MPI Maelstrom / SCU 1068 MPI Maelstrom / UVALive 5398 MPI Maelstrom /ZOJ 1291 MPI Maelstrom (最短路径)

    POJ 1502 MPI Maelstrom / UVA 432 MPI Maelstrom / SCU 1068 MPI Maelstrom / UVALive 5398 MPI Maelstrom ...

  2. POJ 1502 MPI Maelstrom(最短路)

    MPI Maelstrom Time Limit: 1000MS   Memory Limit: 10000K Total Submissions: 4017   Accepted: 2412 Des ...

  3. POJ 1502 MPI Maelstrom (最短路)

    MPI Maelstrom Time Limit: 1000MS   Memory Limit: 10000K Total Submissions: 6044   Accepted: 3761 Des ...

  4. POJ - 1502 MPI Maelstrom 路径传输Dij+sscanf(字符串转数字)

    MPI Maelstrom BIT has recently taken delivery of their new supercomputer, a 32 processor Apollo Odys ...

  5. POJ 1502 MPI Maelstrom [最短路 Dijkstra]

    传送门 MPI Maelstrom Time Limit: 1000MS   Memory Limit: 10000K Total Submissions: 5711   Accepted: 3552 ...

  6. POJ 1502 MPI Maelstrom (Dijkstra)

    题目链接:http://poj.org/problem?id=1502 题意是给你n个点,然后是以下三角的形式输入i j以及权值,x就不算 #include <iostream> #inc ...

  7. (简单) POJ 1502 MPI Maelstrom,Dijkstra。

    Description BIT has recently taken delivery of their new supercomputer, a 32 processor Apollo Odysse ...

  8. POJ 1502 MPI Maelstrom(模板题——Floyd算法)

    题目: BIT has recently taken delivery of their new supercomputer, a 32 processor Apollo Odyssey distri ...

  9. POJ 1502 MPI Maelstrom( Spfa, Floyd, Dijkstra)

    题目大意: 给你 1到n ,  n个计算机进行数据传输, 问从1为起点传输到所有点的最短时间是多少, 其实就是算 1 到所有点的时间中最长的那个点. 然后是数据 给你一个n 代表有n个点, 然后给你一 ...

随机推荐

  1. EditorLineEnds.ttr 错误问题

    安装 Windows Write Live,在线安装,会先安装一个什么补丁,中途提示失败. 运行Delphi2007,第一次成功,第二次就是 EditorLineEnds.ttr文件错误. http: ...

  2. linux下格式化硬盘与挂载硬盘

    格式化: mkfs -t ext4 /dev/sdb 自动挂载: 编辑/etc/fstab文件 sudo nano /etc/fstab,如下图将设备/dev/sdb硬盘挂载到/home/solr/s ...

  3. Spring AOP中pointcut expression表达式解析 及匹配多个条件

    Spring中事务控制相关配置: <bean id="txManager" class="org.springframework.jdbc.datasource.D ...

  4. 黑马程序员——C语言基础 scanf函数 基本运算 三目运算符

    Java培训.Android培训.iOS培训..Net培训.期待与您交流! (一下内容是对黑马苹果入学视频的个人知识点总结) (一)scanf函数 1>  简单介绍一下scanf函数   这是在 ...

  5. [转]source inslght使用指导

    作为一个开放源代码的操作系统,Linux附带的源代码库使得广大爱好者有了一个广泛学习.深入钻研的机会,特别是Linux内核的组织极为复杂,同时,又不能像windows平台的程序一样,可以使用集成开发环 ...

  6. [windows驱动]基本概念

    https://msdn.microsoft.com/zh-cn/library/windows/hardware/ff554721 1.设备节点和设备堆栈 在windows中,设备通过即插即用设备树 ...

  7. 分享Windows Server 2012 R2的获取正版密钥方法

    然后使用“我有ISIC卡”验证,目前可用号码:S420546009858. 分享Windows Server 2012 R2的获取正版密钥方法. 首先登陆dreamspark注册一个账号https:/ ...

  8. dom添加事件

    1.语法:document.getElementById('btn').addEventListener 2.可以添加多个EventListener,且不会覆盖 3.移除EventListener, ...

  9. Oracle排序问题

    关于oracle排序的几点认识: (1)oracle本身不具有任何默认排序功能,要想排序,必须使用order by,而order by后的数据行默认是asc(升序排列),要降序选择desc : (2) ...

  10. Eclipse卡死问题解决办法

    偶尔浏览到几个eclipse卡死的文章,收集一下. 1.  eclipse 3.6卡死 eclipse自动提示反应慢,或者卡死, 有人说这是eclipse 3.6的版本bug, 但是3.5版本好像也有 ...