zoukankan      html  css  js  c++  java
  • poj 1287 Networking【最小生成树prime】

    Networking
    Time Limit: 1000MS   Memory Limit: 10000K
    Total Submissions: 7321   Accepted: 3977

    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

    继续水一道,prime模板题
    #include<stdio.h>
    #include<string.h>
    #define MAX 110
    #define INF 0x3f3f3f3f
    int n,m;
    int map[MAX][MAX],low[MAX];
    bool vis[MAX];
    void init()
    {
    	int i,j;
    	for(i=1;i<=n;i++)
    	    for(j=1;j<=n;j++)
    	        map[i][j]=i==j?0:INF;
    }
    void getmap()
    {
    	int i,j,a,b,c;
    	for(i=0;i<m;i++)
    	{
    		scanf("%d%d%d",&a,&b,&c);
    		if(map[a][b]>c)
    		    map[a][b]=map[b][a]=c;
    	}
    }
    void prime()
    {
    	int i,j,min,mindis=0,next;
    	for(i=1;i<=n;i++)
    	{
    		low[i]=map[1][i];
    		vis[i]=false;
    	}
    	vis[1]=true;
    	for(i=1;i<n;i++)
    	{
    		min=INF;
    		for(j=1;j<=n;j++)
    		{
    			if(!vis[j]&&min>low[j])
    			{
    				next=j;
    				min=low[j];
    			}
    		}
    		mindis+=min;
    		vis[next]=true;
    		for(j=1;j<=n;j++)
    		{
    			if(!vis[j]&&low[j]>map[next][j])
    			    low[j]=map[next][j];
    		}
    	}
    	printf("%d
    ",mindis); 
    }
    int main()
    {
    	while(scanf("%d",&n),n)
    	{
    		scanf("%d",&m);
    		init();
    		getmap();
    		prime();
    	}
    	return 0;
    }
    

      

  • 相关阅读:
    HDU5730 Shell Necklace
    BZOJ4883 [Lydsy2017年5月月赛]棋盘上的守卫
    Spring boot 配置文件
    org.joda.time.DateTime 日期操作
    Elasticsearch + Springboot 启动报错 java.net.ConnectException: Connection refused
    centos7 在docker下安装es Elasticsearch
    centos 7 。 docker 安装rabbitmq 以及集权搭建
    linux 安装mysql5.7.25
    安装rabbtimq CentOS 7
    docker + spring boot 打包 部署。
  • 原文地址:https://www.cnblogs.com/tonghao/p/4725365.html
Copyright © 2011-2022 走看看