【poj1258】Agri-Net——Kruskal
来源:互联网 发布:unity3d模型制作教程 编辑:程序博客网 时间:2024/05/20 00:13
题目:
Agri-Net
Time Limit: 1000MS Memory Limit: 10000KTotal Submissions: 48503 Accepted: 20093
Description
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.
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
40 4 9 214 0 8 179 8 0 1621 17 16 0
Sample Output
28
Source
USACO 102
描述:给定邻接矩阵,求最小生成树题解:kruskal裸题,不过这个kruskal是经过堆优化的
代码:
#include <cstdio>#include <algorithm>#include <cstring>#include <queue>#include <vector>using namespace std;const int maxn = 105;int map[maxn][maxn];struct ee{int u;int v;int w;};int fa[maxn], N;struct cmp{bool operator()(ee a, ee b){return a.w > b.w;}};priority_queue<ee, vector<ee>, cmp> que;void init(){for (int i = 1; i <= N; i++){fa[i] = i;}while (!que.empty())que.pop();}int find(int x){if (fa[x] == x)return x;elsereturn fa[x] = find(fa[x]);}bool unite(int x, int y){int fx = find(x);int fy = find(y);if (fx != fy){fa[fy] = fx;return true;}return false;}int main(){//freopen("input.txt", "r", stdin);while (scanf("%d", &N) != EOF){for (int i = 1; i <= N; i++){for (int j = 1; j <= N; j++){scanf("%d", &map[i][j]);}}ee edge1;int mnt = 0;init();for (int i = 1; i <= N; i++){for (int j = i; j <= N; j++){if (map[i][j] != 0){edge1.u = i;edge1.v = j;edge1.w = map[i][j];que.push(edge1);mnt++;}}}int sum = 0;int cnt = 0;while (cnt < N - 1){ee temp;temp = que.top();que.pop();if (unite(temp.u, temp.v)){sum += temp.w;cnt++;}}printf("%d\n", sum);}return 0;}
0 0
- 【poj1258】Agri-Net——Kruskal
- POJ1258--Agri-Net--Kruskal
- poj1258 Agri-Net ——————【 Kruskal 】
- POJ1258 Agri-Net,Kruskal算法
- POJ1258《Agri-Net》方法:Kruskal
- Agri-Net poj1258||Kruskal模板
- poj1258——Agri-Net
- poj1258 Agri-Net 最小生成树,kruskal算法
- 最小生成树之Kruskal---POJ1258---Agri-Net
- poj1258 Agri-Net 最小生成树 prim kruskal 模板
- POJ1258——Agri-Net(最小生成树)
- poj1258——Agri-Net(最小生成树)
- POJ1258 Agri-Net
- POJ1258 Agri-Net
- POJ1258 Agri-Net
- POJ1258 Agri-Net
- Agri-Net(POJ1258)
- poj1258 - Agri-Net
- Linux 启动 登录过程
- Windows系统编译Openssl源码
- LVS三种工作模式原理
- 我运营公众号这一个月
- Counting Bits
- 【poj1258】Agri-Net——Kruskal
- Ubuntu 中输入法出现两个输入框的解决办法
- 分数的四则运算
- Codeforces 653B Bear and Compressing【DFS】
- 调试小技巧02
- Hardcoded string 汉字, should use @string resource警告
- Java常用排序算法(一):插入排序
- hdu 1159,最大公共子序列 LCS
- 用C++实现杨辉三角