POJ 1287 Networking(最小生成树)
题意 给你n个点 m条边 求最小生成树的权
这是最裸的最小生成树了
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
const int N = 55, M = 3000;
int par[N], n, m, ans;
struct edge{int u, v, w;} e[M];
bool cmp(edge a, edge b){return a.w < b.w;} int Find(int x)
{
int r = x, tmp;
while(par[r] >= 0) r = par[r];
while(x != r)
{
tmp = par[x];
par[x] = r;
x = tmp;
}
return r;
} void Union (int u, int v)
{
int ru = Find(u), rv = Find(v), tmp = par[ru] + par[rv];
if(par[ru] < par[rv])
par[rv] = ru, par[ru] = tmp;
else
par[ru] = rv, par[rv] = tmp;
} void kruskal()
{
memset(par, -1, sizeof(par));
int cnt = 0;
for(int i = 1; i <= m; ++i)
{
int u = e[i].u, v = e[i].v;
if(Find(u) != Find(v))
{
++cnt;
ans += e[i].w;
Union(u, v);
}
if(cnt >= n - 1) break;
}
} int main()
{
int u, v, w;
while(scanf("%d", &n), n)
{
scanf("%d", &m);
for(int i = 1; i <= m; ++i)
{
scanf("%d%d%d", &u, &v, &w);
e[i].u = u, e[i].v = v, e[i].w = w;
}
sort(e + 1, e + m + 1, cmp);
ans = 0;
kruskal();
printf("%d\n", ans);
}
return 0;
}
Networking
Time Limit: 2 Seconds Memory Limit: 65536 KB
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
最新文章
- tornado上手
- 提高mysql千万级大数据SQL查询优化30条经验(Mysql索引优化注意)
- backbone模型层浅析
- Oracle rac集群环境中的特殊问题
- 2010noip提高组解题报告
- Eclipse 安装反编译插件jadclipse(经验总结)
- java.lang.UnsupportedClassVersionError: Bad version number in .class file
- 网页调试技巧:抓取马上跳转的页面POST信息或者页面内容
- SpringBoot 概念和起步
- mysql数据库表的修改及删除
- ios中[UIScreen mainscreen].bounds 的大小是由什么决定的?
- 【apache tika】apache tika获取文件内容(与FileUtils的对比)
- JS高级 - 面向对象1(this,Object ,工厂方式,new )
- cifX驱动安装及SYCON.net的使用
- MFCC
- shell脚本中解决SCP命令需要输入密码的问题
- Linux下nginx 的常用命令
- ubuntu下安装lamp环境
- bzoj3036: 绿豆蛙的归宿(期望DP)
- OOD沉思录 --- 类和对象的关系 --- 使用关系原则