POJ - 1287 Networking(最小生成树模板题)
2015-09-09 20:46
411 查看
POJ - 1287 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 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 #include<iostream> #include<cstdio> #include<cstring> #include<algorithm> using namespace std; const int mnx = 100 + 10; const int mxe = mnx*(mnx - 1) / 2; struct edge { int u, v, c; bool operator < (const edge &b) const { return c < b.c; } }e[mxe]; int n, m; int fa[mnx]; int find(int x) { if (fa[x] != x) fa[x] = find(fa[x]); return fa[x]; } int kruskal() { sort(e + 1, e + m + 1); //边排序 for (int i = 1; i <= n; i++) //并查集初始化 fa[i] = i; int ret = 0; for (int i = 1; i <= m; i++) { int u = e[i].u; int v = e[i].v; int c = e[i].c; u = find(u); v = find(v); if (u != v) { ret += c; fa[u] = v; } } return ret; } int main() { while (scanf("%d", &n) != EOF&&n) { scanf("%d", &m); int a, b, c; for (int i = 1; i <= m; i++) { scanf("%d%d%d", &a, &b, &c); e[i].u = a; e[i].v = b; e[i].c = c; } int ans = kruskal(); printf("%d\n", ans); } } |
相关文章推荐
- 为什么解析 array_column不可用,
- 第一天:探索(2)
- Web前端——JQuery的进阶(测试使用 jQuery进行指定的操作)
- Codechef September Challenge 2015
- 有return的情况下try catch finally的执行顺序
- list.h 解析
- role 'PLUSTRACE' does not exist
- WSDL2java简单使用
- 用枚举器遍历数组倒序输出数组和给数组元素排序
- 书签去重
- list.h 解析
- <Chapter 2>2-1-2.安装Java SDK
- java 自动拆箱(unboxing)和自动装箱(boxing)
- Convert Single Instance to RAC – Part 2: Manually Convert to RAC
- Android视频播放手动切换和自动切换横竖屏冲突问题
- 在线教学系统:C#实现网络电子白板、课件功能
- 文件上传
- Http请求和相应模式(B/S)(1)
- Socket通信:简单传输到增加多线程进行多数据传输
- JackJson反序列化为何一定需要TypeReference