Agri-Net POJ
来源:互联网 发布:淘宝指数是什么意思 编辑:程序博客网 时间:2024/05/17 13:11
Agri-Net
POJ - 1258Farmer 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.
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.
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.
40 4 9 214 0 8 179 8 0 1621 17 16 0
28
code:
#include <iostream>#include <cstdio>#include <cstring>#include <algorithm>using namespace std;int G[105][105];int n;struct node{ int from,to; int len;}farm[10005];bool cmp(node a,node b){ return a.len < b.len;}int pre[105];int Find(int x){ if(x == pre[x]) return x; else return pre[x] = Find(pre[x]);}int Union(int x,int y){ int fx = Find(x),fy = Find(y); if(fx == fy) return 0; else{ pre[fy] = fx; return 1; }}int main(){ while(~scanf("%d",&n)){ int i,j; for(i = 0; i < 105; i++) pre[i] = i; int cnt = 0; for(i = 0; i < n; i++){ for(j = 0; j < n; j++){ scanf("%d",&G[i][j]); if(G[i][j] != 0){ farm[cnt].from = i; farm[cnt].to = j; farm[cnt++].len = G[i][j]; } } } sort(farm,farm+cnt,cmp); int num = 0; int sum = 0; for(i = 0; i < cnt; i++){ if(Union(farm[i].from,farm[i].to)){ sum += farm[i].len; num++; } if(num == n-1) break; } cout << sum << endl; } return 0;}
阅读全文
0 0
- POJ 1258 Agri-Net
- POJ 1258 Agri-Net
- POJ 1258 Agri-Net
- poj 1258-Agri-net
- poj 1258 Agri-Net
- poj 1258 Agri-Net
- POJ+1258++Agri-Net
- poj 1259 Agri-Net
- Poj 1258 Agri-Net
- poj 1258 Agri-Net
- poj 1258 Agri-Net
- poj 1258 Agri-Net
- POJ 1258 Agri-Net
- POJ 1258 Agri-Net
- POJ 1258 Agri-Net
- poj-1258-Agri-Net
- poj-1258 Agri-Net
- Poj 1258 Agri-Net
- matplotlib基础
- 20171206
- php+apache+yaf框架开发环境搭建
- 软件光栅化渲染器一
- Spring 获取方法参数名
- Agri-Net POJ
- UML总结(一)----学习主要重点概述
- 系统调用和库函数及API的区别
- Java Web中实现文件上传(一)
- 相比于C,python更简便
- [jzoj]2248. 【2017.12.02普及组模拟】送快递(二分+set)
- oracle查询哪些表被谁锁住了
- 棋盘DP尝试
- node.js 异步变同步——获取一个文件夹内的所有文件夹