POJ 1287 Networking
2016-01-15 19:59
429 查看
Networking
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
Sample Output
Source
Southeastern Europe 2002
最小生成树,没有什么难度:)不过因为数组开小了WA了两次
Time Limit: 1000MS | Memory Limit: 10000K | |
Total Submissions: 7702 | Accepted: 4219 |
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
Source
Southeastern Europe 2002
最小生成树,没有什么难度:)不过因为数组开小了WA了两次
#include<stdio.h> #include<string.h> #include<algorithm> using namespace std; int per[100]; struct Edge { int start,end,pow; }a[55*55]; bool cmp(Edge a,Edge b) { return a.pow<b.pow; } int Find(int r) { while(r!=per[r]) r=per[r]; return r; } int Judge(int x,int y) { int fx=Find(x); int fy=Find(y); if(fx!=fy) { per[fx]=fy; return 1; } return 0; } int main() { int m,n,t,i; while(scanf("%d",&m)) { if(m==0) break; int sum=0; scanf("%d",&n); for(i=1;i<=n;i++) per[i]=i; memset(a,0,sizeof(a)); for(i=0;i<n;i++) { scanf("%d%d",&a[i].start,&a[i].end); scanf("%d",&a[i].pow); } sort(a,a+n,cmp); for(i=0;i<n;i++) { if(Judge(a[i].start,a[i].end)) sum+=a[i].pow; } printf("%d\n",sum); } return 0; }
相关文章推荐
- 位运算函数实现float型变量取整数位
- Java对象的强、软、弱和虚引用原理+结合ReferenceQueue对象构造Java对象的高速缓存器
- Windows 下使用命令行编译C/C++文件
- HYSBZ1036 树链剖分
- 【手把手教你全文检索】Lucene索引的【增、删、改、查】
- Android AppWidget控制手机上网APN接入点
- Mysql 中 if 的 用法
- Codeforces Round #339 (Div. 2) B. Gena's Code 水题
- poj3237 树链剖分 暴力
- hdu2548 两军交锋
- Linux驱动Platform总线模型
- LeetCode_HappyNumber_哈希表的使用
- 手把手教你全文检索 Apache Lucene初探
- 三格图片轮播
- ios 公司账号申请
- 网络发现打不开,每次点开启之后又变关闭
- 【SSH进阶之路】Hibernate映射——多对一单向关联映射(四)
- 多线程的基本概念
- git hook部署代码
- 数据结构优化连边