POJ 1502 MPI Maelstrom
MPI Maelstrom
Time Limit : 2000/1000ms (Java/Other) Memory Limit : 20000/10000K (Java/Other)
Total Submission(s) : 2 Accepted Submission(s) : 1
``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.''
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.
time required to broadcast a message from the first processor to all the other
processors.
由于自身到自身花费的时间为0,所以没有给出,由于i到j和j到i距离相同,互达时间相同
所以只给出了一半的临界矩阵。
根据给你的这个临界矩阵,让你来求从点1到其他点所花费最短时间集里面的的最大值。
其实这是一个很直接的最短路
#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的更多相关文章
- 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 ...
- POJ 1502 MPI Maelstrom(最短路)
MPI Maelstrom Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 4017 Accepted: 2412 Des ...
- POJ 1502 MPI Maelstrom (最短路)
MPI Maelstrom Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 6044 Accepted: 3761 Des ...
- POJ - 1502 MPI Maelstrom 路径传输Dij+sscanf(字符串转数字)
MPI Maelstrom BIT has recently taken delivery of their new supercomputer, a 32 processor Apollo Odys ...
- POJ 1502 MPI Maelstrom [最短路 Dijkstra]
传送门 MPI Maelstrom Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 5711 Accepted: 3552 ...
- POJ 1502 MPI Maelstrom (Dijkstra)
题目链接:http://poj.org/problem?id=1502 题意是给你n个点,然后是以下三角的形式输入i j以及权值,x就不算 #include <iostream> #inc ...
- (简单) POJ 1502 MPI Maelstrom,Dijkstra。
Description BIT has recently taken delivery of their new supercomputer, a 32 processor Apollo Odysse ...
- POJ 1502 MPI Maelstrom(模板题——Floyd算法)
题目: BIT has recently taken delivery of their new supercomputer, a 32 processor Apollo Odyssey distri ...
- POJ 1502 MPI Maelstrom( Spfa, Floyd, Dijkstra)
题目大意: 给你 1到n , n个计算机进行数据传输, 问从1为起点传输到所有点的最短时间是多少, 其实就是算 1 到所有点的时间中最长的那个点. 然后是数据 给你一个n 代表有n个点, 然后给你一 ...
随机推荐
- LA 4123 - Glenbow Museum
https://icpcarchive.ecs.baylor.edu/index.php?option=com_onlinejudge&Itemid=8&page=show_probl ...
- HTTP协议的chunked编码
一般情况HTTP的Header包含Content-Length域来指明报文体的长度.如: 有时候服务生成HTTP回应是无法确定消息大小的,比如大文件的下载,或者后台需要复杂的逻辑才能全部处理页面的请求 ...
- USB鼠标按键驱动
现象:把USB设备接到PC 1. 右下角弹出"发现android phone" 2. 跳出一个对话框,提示你安装驱动程序 问1. 既然还没有"驱动程序",为何能 ...
- Codeforces Round #378 (Div. 2) D题(data structure)解题报告
题目地址 先简单的总结一下这次CF,前两道题非常的水,可是第一题又是因为自己想的不够周到而被Hack了一次(或许也应该感谢这个hack我的人,使我没有最后在赛后测试中WA).做到C题时看到题目情况非常 ...
- mysql 远程连接
4.现在如果用你电脑上的终端进行MySQL连接时,有可能出现如下错误: MySQL远程连接ERROR 2003 (HY000):Can't connect to MySQL server on'XXX ...
- 8种主要排序算法的C#实现
作者:胖鸟低飞 出处:http://www.cnblogs.com/fatbird/ 简介 排序算法是我们编程中遇到的最多的算法.目前主流的算法有8种. 平均时间复杂度从高到低依次是: 冒泡排序(o( ...
- 如何利用SVN合并代码
一. 背景 平时在进行开发时,一般都会有多版本同时进行,包括项目版本.周版本.紧急版本等,当某一个版本具备上线条件后,需要在上一个已发布的版本基础上进行发布,才能够避免出现版本相互覆盖,因此 ...
- APP store 上架过程中碰到的那些坑&被拒的各种奇葩原因整理&审核指南中文版
苹果官方发布的十大常见被拒原因 1.崩溃次数和Bug数量.苹果要求开发者在将应用提交给App Store之前彻查自己的应用,以尽量避免Bug的存在. 2.链或错误的链接.应用中所有的链接必须是真实且有 ...
- MicroPython开发板TPYBoard关于USB-HID的应用
USB-HID是Human Interface Device的缩写,属于人机交互操作的设备,如USB鼠标,USB键盘,USB游戏操纵杆,USB触摸板,USB轨迹球.电话拨号设备.VCR遥控等等设备. ...
- Git搭建团队开发环境操作演练
模拟创建远程git仓库 1.首先创建如下目录结构: /Users/hujh/Desktop/GitTest2/GitServer/weibo weibo是我们要创建的项目 2.切换目录 $ cd /U ...