文档章节

sicily 1083 Networking

Ciel
 Ciel
发布于 2013/01/19 17:36
字数 657
阅读 29
收藏 0

Description

You are assigned to design network connections between certain points in a wide area. You are given a set of points in the area, and a set of possible routes for the cables that may connect pairs of points. For each possible route between two points, you are given the length of the cable that is needed to connect the points over that route. Note that there may exist many possible routes between two given points. It is assumed that the given possible routes connect (directly or indirectly) each two points in the area.

Your task is to design the network for the area, so that there is a connection (direct or indirect) between every two points (i.e., all the points are interconnected, but not necessarily by a direct cable), and that the total length of the used cable is minimal.

Input

The input file consists of a number of data sets. Each data set defines one required network. The first line of the set contains two integers: the first defines the number P of the given points, and the second the number R of given routes between the points. The following R lines define the given routes between the points, each giving three integer numbers: the first two numbers identify the points, and the third gives the length of the route. The numbers are separated with white spaces. A data set giving only one number P=0 denotes the end of the input. The data sets are separated with an empty line.

The maximal number of points is 50. The maximal length of a given route is 100. The number of possible routes is unlimited. The nodes are identified with integers between 1 and P (inclusive). The routes between two points i and j may be given as i j or as j i.

Output

For each data set, print one number on a separate line that gives the total length of the cable used for the entire designed network.

Sample Input

1 0

2 3
1 2 37
2 1 17
1 2 68

3 7
1 2 19
2 3 11
3 1 7
1 3 5
2 3 89
3 1 91
1 2 32

5 7
1 2 5
2 3 7
2 4 8
4 5 11
3 5 10
1 5 6
4 2 12

0

Sample Output

0
17
16
26

分析:

最小生成树考察,此处录入边的权值的时候就会进行第一步处理,直接使用Prim算法。因为数据规模很小,所以也就懒得优化了。

代码:

// Problem#: 1083
// Submission#: 1904485
// The source code is licensed under Creative Commons Attribution-NonCommercial-ShareAlike 3.0 Unported License
// URI: http://creativecommons.org/licenses/by-nc-sa/3.0/
// All Copyright reserved by Informatic Lab of Sun Yat-sen University
#include <iostream>
using namespace std;

#define MAX 51
#define INF 1000

int len[MAX][MAX];
int tmp[MAX];

inline int min(int n){
    int min = INF;
    int re;
    for (int i = 1 ; i <= n; ++i) {
        if(tmp[i] && tmp[i]<min){
            min = tmp[i];
            re = i;
        }
    }
    return re;
}

int mst(int n){
    int re = 0;
    for (int i = 1; i <= n; ++i)
        tmp[i] = len[1][i];
    tmp[1] = 0;
    for (int i = 2; i <= n; ++i) {
        int k = min(n);
        re += tmp[k];
        tmp[k] = 0;
        for (int j = 1; j <= n; ++j)
            if (tmp[j] > len[k][j])
                tmp[j] = len[k][j];
    }
    return re;
}

int main() {
    int p, r, a, b, l;
    do {
        cin >> p;
        if(!p) break;
        cin >> r;
        for (int i = 1; i <= p; ++i)
            for (int j = 1; j <= p ; ++j)
                len[i][j] = INF;
        while (r--) {
            cin >> a >> b >> l;
            if (len[a][b] > l)
                len[a][b] = len[b][a] = l;
        }
        cout << mst(p) << endl;
    } while (true);
    return 0;
}

© 著作权归作者所有

Ciel
粉丝 3
博文 24
码字总数 18532
作品 0
程序员
私信 提问
Oracle 11g R2 ADG 搭建

--============Oracle ADG搭建============== --==========准备阶段========= 1.检查primary为archivelog模式。 select log_mode from v$database; 如果为noarchivelog模式,切换到archivelo......

UltraSQL
2018/07/23
0
0
Athreos ar8151 for centos6_64的激活

最近使用pc安装centos6_64的操作系统,安装完后集成网卡不能使用,折腾过好些方法 下载AR81Family-Linux-v1.0.1.9.tar.gz(本以为这下可以解决了,高兴啊) 但是并不能像网上有的说的那样使用...

kimgshe
2012/02/14
0
0
[急]tomcat 启动报错

今天发布war时启动服务器时,发现服务器报以下错误: SEVERE: Exception fixing docBase for context [/sjfx] java.util.zip.ZipException: error in opening zip file at java.util.zip.Zip......

iFlyS
2014/11/17
10.2K
5
分布式消息系统spread的安装和使用

http://www.maycode.com/index.php/hotspot/35-linux/1083-queue.html

红薯
2009/01/09
1K
1
给Android开发者的Rxjava详解

http://gank.io/post/560e15be2dca930e00da1083#toc8

海阔天空玩世不恭
2016/04/13
53
0

没有更多内容

加载失败,请刷新页面

加载更多

常用正则表达式整理

本文转载于:专业的前端网站➩常用正则表达式整理 /*以下为亲自验证过,备用*/   数字,0-100,包含0和100,且小数点后最多有三位: /^(\d{1,2}(\.\d{1,3})?|100)$/ 匹配正整数:^[1-9]*[1-9][...

前端老手
14分钟前
4
0
Java 中可重入锁、不可重入锁的测试

Java 中可重入锁、不可重入锁的测试 可重入锁 指在同一个线程在外层方法获取锁的时候,进入内层方法会自动获取锁。 为了避免死锁的发生,JDK 中基本都是可重入锁。 下面我们来测试一下 sync...

ConstXiong
14分钟前
4
0
怎么给视频变音

怎么让录制视频中的声音变得可爱吗?其实方法非常的简单,只要进行视频变音制作就好了,那怎么给视频变音呢?下面就一起来看看视频变音的具体制作方法吧! 具体步骤如下: 第一步: 打开手机...

白米稀饭2019
18分钟前
4
0
学习记录(ECMAScript 6.0入门_day01重点总结)

课程目标 1、ECMAScript6和JAVAScript关系 ES6是JAVAScript的规格,JavaScript是ES6的一种实现。 变量声明: 局部变量:let 它的用法类似于var,但是所声明的变量,只在let命令所在的代码块内...

庭前云落
30分钟前
4
0
springboot 源码SpringApplication的run方法解析

public ConfigurableApplicationContext run(String... args) {//记录启动应用启动时间StopWatch stopWatch = new StopWatch();stopWatch.start();ConfigurableApplicationCo......

dudu
32分钟前
5
0

没有更多内容

加载失败,请刷新页面

加载更多

返回顶部
顶部