poj1287 Networking
2016-01-31 22:57
246 查看
思路:最小生成树模板题
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
#include <cstdio> #include <queue> #include <cstring> #include <iostream> #include <cstdlib> #include <algorithm> #include <vector> #include <map> #include <string> #include <set> #include <ctime> #include <cmath> #include <cctype> using namespace std; #define maxn 1000 #define LL long long int cas=1,T; const int maxm = 11000; struct Edge { int u,v; int dist; Edge(){} Edge(int u,int v,int d):u(u),v(v),dist(d){} bool operator < (const Edge&rhs)const { return dist < rhs.dist; } }; int n,m; Edge edges[maxm]; int pre[maxn]; int Find(int x) { return pre[x]==-1?x:Find(pre[x]); } void init() { m=0; memset(pre,-1,sizeof(pre)); } void AddEdge(int u,int v,double dist) { edges[m++]=Edge(u,v,dist); } int Kruskal() { int sum = 0; int cnt = 0; sort(edges,edges+m); for (int i = 0;i<m;i++) { int u = edges[i].u; int v = edges[i].v; if (Find(u) != Find(v)) { pre[Find(u)] = Find(v); sum+=edges[i].dist; if (++cnt >= n-1) break; } } return sum; } int main() { //freopen("in","r",stdin); while(scanf("%d",&n) && n) { init(); int mm; scanf("%d",&mm); if (mm==0) { printf("0\n"); continue; } for (int i = 0;i<mm;i++) { int a,b,c; scanf("%d%d%d",&a,&b,&c); AddEdge(a,b,c); } printf("%d\n",Kruskal()); } //printf("time=%.3lf",(double)clock()/CLOCKS_PER_SEC); return 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
相关文章推荐
- 1040. 有几个PAT(25)
- 重装系统(win7)
- NYoj745 蚂蚁的难题(二)
- 1039. 到底买不买(20)
- 64位Linux安装android开发IDE的全过程
- 【codevs1958】刺激
- servlet / jsp 学习——java,关系,区别,核心概念,代码例子
- java中的==、equals()、hashCode()
- libc++ hashtable 源码简析
- 1038. 统计同成绩学生(20)
- 面试笔试杂项积累-leetcode 56-60
- 后缀数组(Suffix Array)学(复)习小记
- Java获取当前年月日、时间
- Android sdk无法下载解决方法
- Android 自定义ViewGroup 实战篇 -> 实现FlowLayout
- Android购物动画
- 重温JSP学习笔记--JSTL标签库
- 值得推荐的C/C++框架和库
- Mysql 忘记密码;安全优化;log位置
- 记毕设如何做一个在线评测系统