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>



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

POJ 1287 Networking(最小生成树)

Description You are assigned to design network connections between certain points in a wide area. Y...

POJ-1287-Networking(最小生成树 普利姆)

B - Networking Time Limit:1000MS Memory Limit:10000KB 64bit IO Format:%I64d & %I64u Submit...

zoj 1372 ||poj 1287 Networking(最小生成树-Kruskal)

学习了下Kruskal  and  并查集,先水一道最小生成树,题意简单。 SF多次,因为把边的长度看成边的条数,,,囧啊==水完果断睡觉去== #include #include #includ...
  • cqlf__
  • cqlf__
  • 2012年01月27日 00:21
  • 816

POJ1287 Networking(最小生成树,Kruskal,Prim)

题目: Networking Time Limit: 1000MS   Memory Limit: 10000K Total Submissi...

Poj 1287 Networking【最小生成树】

Networking Time Limit: 1000MS   Memory Limit: 10000K Total Submissions: 7323   Accepted: 3979 ...

POJ 1287 Networking (最小生成树入门)

欢迎使用Markdown编辑器写博客本Markdown编辑器使用StackEdit修改而来,用它写博客,将会带来全新的体验哦: Markdown和扩展Markdown简洁的语法 代码块高亮 图片链接和...

【POJ1287】Networking(最小生成树)

这里是题目Networking Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 11916 Accep...
  • RRicky_
  • RRicky_
  • 2017年08月03日 23:15
  • 95

【POJ】-1287-Networking(最小生成树)

Networking Time Limit: 1000MS   Memory Limit: 10000K Total Submissions: 8557   Acc...

POJ1287 Networking (Kruskal与并查集求解最小生成树)

 Description You are assigned to design network connections between certain points in a wide are...

【POJ】1287 - Networking(最小生成树(克鲁斯塔尔),水)

Networking Time Limit: 1000MS   Memory Limit: 10000K Total Submissions: 7698   Acc...
  • wyg1997
  • wyg1997
  • 2016年01月13日 12:29
  • 149
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:poj 1287 Networking ->最小生成树
举报原因:
原因补充:

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