POJ 1287Networking (kruskal)
来源:互联网 发布:工作时间记录软件 编辑:程序博客网 时间:2024/05/16 07:14
Networking
Time Limit: 1000MS Memory Limit: 10000KTotal Submissions: 12622 Accepted: 6773
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.
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.
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 02 31 2 372 1 171 2 683 71 2 192 3 113 1 71 3 52 3 893 1 911 2 325 71 2 52 3 72 4 84 5 113 5 101 5 64 2 120
Sample Output
0171626
最小生成树模板题
入门:http://www.cnblogs.com/biyeymyhjob/archive/2012/07/30/2615542.html
kruskal
#include <iostream>#include <algorithm>#include <cstdio>#include <cstring>#include <cmath>#include <string>#include <set>#include <map>#include <stack>#include <vector>#include <list>#include <bitset>#include <queue>using namespace std;#define mem(a, b) memset(a, b, sizeof(a))#define ll long long#define debug() puts("FFF~!!!!!");const int inf = 0x3f3f3f3f;const int maxn = 1300;int n, m;int cnt, p[maxn];struct Edge { int u, v, cost;}edge[maxn];bool cmp(Edge a, Edge b) { return a.cost < b.cost;}int find(int x) { return p[x] = x == p[x] ? x : find(p[x]);}int kruskal() { int ans = 0; for (int i = 0; i <= n; i ++) { p[i] = i; } sort(edge, edge + m, cmp); for (int i = 0; i < m; i ++) { int x = find(edge[i].u); int y = find(edge[i].v); if (x != y) { p[x] = y; ans += edge[i].cost; } } return ans;}int main(){ while (cin >> n && n) { cin >> m; for (int i = 0; i < m; i ++) { cin >> edge[i].u >> edge[i].v >> edge[i].cost; } int ans = kruskal(); cout << ans << endl; }}
阅读全文
0 0
- poj 1287 Networking(Kruskal)
- POJ 1287Networking (kruskal)
- poj 1287 networking kruskal
- POJ 1287 Networking (Kruskal)
- POJ 1287 Networking【kruskal】
- poj 1287 Networking(kruskal || prim)
- 图论 生成树 POJ 1287 Networking(prim)( Kruskal)
- POJ - 1287 Networking (最小生成树Kruskal)
- POJ 1287:Networking(最小生成树Kruskal)
- POJ 1287 Networking(最小生成树kruskal)
- ZOJ 1372 / POJ 1287 Networking ( kruskal+prim )
- zoj 1372 || poj 1287 Networking ( prim || kruskal ~)
- Networking(Kruskal)
- zoj 1372 ||poj 1287 Networking(最小生成树-Kruskal)
- POJ - 1287----Networking(prim)
- poj 1287||zoj 1372 Networking 最小生成树 kruskal 克鲁斯卡尔算法
- POJ 1287 Networking(prime算法)
- POJ 1287 Networking(最小生成树)
- MongoDB数据库设计中6条重要的经验法则
- 解决Let’s Encrypt SSL证书配置错误
- 智能指针
- Java
- 关于程序崩溃的问题总结【经验】
- POJ 1287Networking (kruskal)
- Arduino 开发入门 学习笔记 Arduino编程基础
- 将数组元素拼接到对象数组中
- solr学习笔记
- win10怎么设置电脑开机密码?
- CCF JSON查询
- PPP配置
- Swiper移动端网站的内容触摸滑动
- React学习(八):Redux基础