POJ1258——Prim——Agri-Net
2015-03-08 15:28
267 查看
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.
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
Source
USACO 102
大意:铺电缆,不就是铺路嘛(⊙_⊙),直接写一个A了
View Code
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
4 0 4 9 21 4 0 8 17 9 8 0 16 21 17 16 0
Sample Output
28
Source
USACO 102
大意:铺电缆,不就是铺路嘛(⊙_⊙),直接写一个A了
#include<cstdio> #include<cstring> #include<algorithm> using namespace std; const int inf = 0x3f3f3f3f,MAX = 3000; int map[MAX][MAX], k[MAX]; void prim (int map[MAX][MAX],int n){ int min1,m,ans = 0; for(int i = 1; i <= n ;i++) k[i] = map[1][i]; for(int i = 1; i < n ;i++){ int min1 = inf; m = 0; for(int j = 1; j <= n ;j++){ if(k[j] < min1 && k[j]!=0){ min1 = k[j]; m = j; } } k[m] = 0; ans +=min1; for(int j = 1; j <= n ; j++){ if(k[j] > map[m][j] && k[j]!=0) k[j] = map[m][j]; } } printf("%d\n",ans); } int main() { int n,a; while(~scanf("%d",&n)&&n){ for(int i = 1; i <= n ;i++) for(int j = 1; j <= n ;j++) scanf("%d",&map[i][j]); prim(map,n); } return 0; }
View Code
相关文章推荐
- POJ 1258:Agri-Net(最小生成树&&prim)
- poj 1258 Agri-Net (最小生成树 prim)
- POJ 1258 Agri-Net (prim求MST)
- poj 1258 Agri-Net(Kruskal || Prim )
- POJ 1258 Agri-Net(裸prim)
- POJ 1258 Agri-Net (prim + kruskal)
- poj 1258 Agri-Net(Prim)(基础)
- POJ 1258 - Agri-Net(最小生成树' Prim)
- Agri-Net (poj 1258 最短路+prim)
- POJ 1258:Agri-Net:典型prim最小生成树(3)
- poj&nbsp;1258&nbsp;Agri-Net(prim)
- POJ 1258 Agri-Net最小生成树 prim
- poj 1258 Agri-Net Prim + kruskal
- Agri-Net - poj 1258 (Prim 算法)
- POJ 1258 Agri-Net 最小生成树 Prim
- poj1258 - Agri-Net (经典邻接矩阵 求最小生成树) (Prim & Kruskal)
- POJ 1258 Agri-Net (prim最小生成树)
- Poj1258 Agri-Net (Prim)
- POJ 1258 Agri-Net (prim)
- POJ1258 Agri-Net(Prim求解最小生成树)