poj 1287 Networking ->最小生成树

原创 2015年07月10日 21:13:24


here                                                                                                                            


Networking
Time Limit: 1000MS   Memory Limit: 10000K
Total Submissions: 6819   Accepted: 3719

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


经典的最小生成树题目,附代码(kruskal)

<strong>#include<iostream>
#include<string.h>
#include<math.h>
#include<stdio.h>
#include<algorithm>
#include<queue>
using namespace std;
#define  LL __int64
LL a[112010],b[112010],w[112010],xu[112010],fu[111008];
bool cmp(LL a,LL b)
{
  return w[a]<w[b];
}
LL findfa(LL x)
{
   return  x==fu[x]? x: fu[x]=findfa(fu[x]);
}
int  main()
{
  LL n,m;
  while(~scanf("%I64d",&m))
  {
        if(m==0 ) break;
        scanf("%I64d",&n);
      for(LL i=0;i<n;i++)
        {
            scanf("%I64d%I64d%I64d",&a[i],&b[i],&w[i]);
            xu[i]=i;
        }
    sort(xu,xu+n,cmp);
    for(LL i=1;i<=m;i++)
        fu[i]=i;

    LL sum=0;
    for(LL i=0;i<n;i++)
    {
        LL newa=findfa(a[xu[i]]);
        LL newb=findfa(b[xu[i]]);
        if(newa!=newb)
        {
            fu[newa]=newb;
            sum+=w[xu[i]];
        }
    }
    printf("%I64d\n",sum);
  }
}
</strong>



版权声明:本文为博主原创文章,未经博主允许不得转载。

POJ1287Networking(最小生成树,裸题)

Description You are assigned to design network connections between certain points in a wide area....
  • z1192277815
  • z1192277815
  • 2016年08月03日 21:32
  • 496

【最小生成树】POJ 1287 Networking

DescriptionYou are assigned to design network connections between certain points in a wide area. You...
  • hyj542682306
  • hyj542682306
  • 2017年04月24日 09:28
  • 218

[POJ - 1287] Networking(最小生成树)

Link:http://poj.org/problem?id=1287题目:You are assigned to design network connections between certain...
  • JomoDimple_
  • JomoDimple_
  • 2017年08月05日 17:38
  • 85

poj 1287 Networking(最小生成树)

Networking Time Limit: 1000MS   Memory Limit: 10000K Total Submissions: 6589   Acc...
  • acm_BaiHuzi
  • acm_BaiHuzi
  • 2015年03月19日 20:35
  • 509

POJ 1287 Networking(最小生成树)

Description You are assigned to design network connections between certain points in a wide area....
  • u013582254
  • u013582254
  • 2014年07月31日 19:17
  • 483

poj 1287 Networking(最小生成树)

题目来源:POJ 1287 简单题目分析: 给你若干点,以及两点间的距离,求将所有点连通的最小距离。 思路:最小生成树(MST),并查集+Kruskal算法。 Kruskal算法采用贪心策略,...
  • polanwind
  • polanwind
  • 2017年05月07日 22:04
  • 88

POJ 1287 Networking(最小生成树)

POJ 1287 Networking(最小生成树) http://poj.org/problem?id=1287 题意:        给你一个N个点和M条边的无向图,要求最小生成树的权值. 分析:...
  • u013480600
  • u013480600
  • 2014年07月20日 19:49
  • 781

POJ 1287 最小生成树 Networking

题目链接:http://poj.org/problem?id=1287 #include #include #include #include #include #include #include ...
  • du489380262
  • du489380262
  • 2013年05月09日 12:55
  • 483

POJ 1287 Networking【最小生成树】

Networking Time Limit: 1000MS   Memory Limit: 10000K Total Submissions: 11840   Ac...
  • qq_38465092
  • qq_38465092
  • 2017年08月03日 16:54
  • 61

POJ 1287 Networking(最小生成树)

Description You are assigned to design network connections between certain points in a wide area. Y...
  • feizaoSYUACM
  • feizaoSYUACM
  • 2017年01月31日 20:11
  • 198
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:poj 1287 Networking ->最小生成树
举报原因:
原因补充:

(最多只允许输入30个字)