【OpenJ_Bailian - 1258】【POJ - 1258】Agri-Net （最小生成树裸题）

题干：

Farmer John has been elected mayor of his town! One of his campaign promises was to bring internet connectivity to all farms in the area. He needs your help, of course.
Farmer John ordered a high speed connection for his farm and is going to share his connectivity with the other farmers. To minimize cost, he wants to lay the minimum amount of optical fiber to connect his farm to all the other farms.
Given a list of how much fiber it takes to connect each pair of farms, you must find the minimum amount of fiber needed to connect them all together. Each farm must connect to some other farm such that a packet can flow from any one farm to any other farm.
The distance between any two farms will not exceed 100,000.

Input

The input includes several cases. For each case, the first line contains the number of farms, N (3 <= N <= 100). The following lines contain the N x N conectivity matrix, where each element shows the distance from on farm to another. Logically, they are N lines of N space-separated integers. Physically, they are limited in length to 80 characters, so some lines continue onto others. Of course, the diagonal will be 0, since the distance from farm i to itself is not interesting for this problem.

Output

For each case, output a single integer length that is the sum of the minimum length of fiber required to connect the entire set of farms.

Sample Input

Sample Output

解题报告：

最小生成树裸题。

AC代码：

#include<cstdio>
#include<queue>
#include<cstring>
#include<cmath>
#include<iostream>
#include<algorithm>
using namespace std;int n,m;
int top,f[105];
struct Edge {int u,v,w;Edge(){}Edge(int u,int v,int w):u(u),v(v),w(w){}
} e[100 * 99];
int getf(int u) {return f[u]==u?u:f[u]=getf(f[u]);
}
void merge(int u,int v) {int t1 = getf(u);int t2 = getf(v);if(t1!=t2) f[t2]=t1;
}
bool cmp(Edge a,Edge b) {return a.w < b.w;
}
int main()
{int val;while(~scanf("%d",&n)) {top = 0;for(int i = 1; i<=n; i++) {f[i]=i;for(int j = 1; j<=n; j++) {scanf("%d",&val);if(i!=j) e[++top] = Edge(i,j,val);}}sort(e+1,e+top+1,cmp);m=0;val = 0;for(int i = 1; i<=top; i++) {if(getf(e[i].u) != getf(e[i].v)) {m++;merge(e[i].u,e[i].v);val += e[i].w;}if(m == n-1) break;}printf("%d\n",val);}   return 0;
}

总结：其实那个 i != j可以改成i<j，会稍微快一点，不过也无所谓都可以ac，一个6ms，一个5ms。

【OpenJ_Bailian - 1258】【POJ - 1258】Agri-Net （最小生成树裸题）相关推荐

【HDU - 1102】Constructing Roads （最小生成树裸题模板）
题干: There are N villages, which are numbered from 1 to N, and you should build some roads such that ...
CSP认证201412-4 最优灌溉[C++题解]：最小生成树裸题、Kruskal算法求最小生成树
题目分析来源:acwing 分析:这是一道最小生成树的裸题. 这里默写Kruskal求最小生成树的最小费用的模板. 最小生成树模板请参考笔者的另一篇博文: 最小生成树板子-AcWing 859. K ...
BZOJ 1083: [SCOI2005]繁忙的都市【Kruscal最小生成树裸题】
1083: [SCOI2005]繁忙的都市 Time Limit: 10 Sec Memory Limit: 162 MB Submit: 2925 Solved: 1927 [Submit][S ...
惠民工程(最小生成树裸题)
惠民工程 Time Limit:1000MS Memory Limit:131072KB 64bit IO Format:%lld & %llu Submit Status Descripti ...
最小生成树模板 POJ——1258
最小生成树是一个比较简单数据结构,形成最小生成树的方式有两种. 最小生成树是有图生成树,保证树的每条边的权值之和最小的生成树就叫做最小生成树,这一类的题目起初比较基础,主要是熟悉模板,POJ 1258 ...
POJ 1258 Agri-Net （最小生成树）
题目: Description Farmer John has been elected mayor of his town! One of his campaign promises was to ...
【POJ - 3624 】Charm Bracelet （dp，0-1背包裸题）
题干: Bessie has gone to the mall's jewelry store and spies a charm bracelet. Of course, she'd like to ...
POJ1258最小生成树简单题
题意: 给你个图,让你求一颗最小生成树. 思路: 裸题,克鲁斯卡尔或者普利姆都行. #include<stdio.h> #include<algorithm&g ...
最大流问题模板-java-蓝桥杯-算法训练-网络流裸题
1. 本题相关资料题目链接这是一道求最大流的模板题. 最大流预备知识:dfs,bfs,图论基础(图的存储). 网上已经有很多最大流的解析,我就不再唠叨了,还不了解的同学可参考这个博客:什么是最大流 ...

【OpenJ_Bailian - 1258】【POJ - 1258】Agri-Net （最小生成树裸题）

【OpenJ_Bailian - 1258】【POJ - 1258】Agri-Net （最小生成树裸题）相关推荐

最新文章

热门文章