POJ 1258 Agri-Net
发布日期:2022-02-05 18:27:26 浏览次数:4 分类:技术文章

本文共 2368 字,大约阅读时间需要 7 分钟。

Agri-Net
Time Limit: 1000MS   Memory Limit: 10000K
Total Submissions: 34245   Accepted: 13772

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

40 4 9 214 0 8 179 8 0 1621 17 16 0

Sample Output

28



最小生成树

给的邻接矩阵 蒟蒻不会prim怎么办

转化成临界表kruskal吧。。。

还要注意是多组数据 注意初始化

#include
   
    #include
    
     #include
     
      #include
      
       using namespace std;struct self{int x,y,w;}s[10011];int g[101][101];int f[101];int find(int i){return i==f[i]?i:f[i]=find(f[i]);}int m,n,a,b,c,z;int cmp(self a1,self a2){
       
if(a1.w==a2.w)
{
if(a1.y==a2.y)return a1.x
return a1.y
}
return a1.w
sort(s+1,s+n+1,cmp);
int have=0;
for(a=1;a<=n;a++)
{
int l=find(s[a].x),r=find(s[a].y);
if(l!=r)
{
f[l]=r;
z+=s[a].w;
have++;
if(have==m-1)return;
}
}}
int main(){
while(scanf("%d",&m)==1)
{
z=0,n=0;
for(a=1;a<=m;a++)
for(b=1;b<=m;b++)
scanf("%d",&g[a][b]);
for(a=1;a<=m;a++)
for(b=a+1;b<=m;b++)
{
n++;
s[n].x=a;s[n].y=b;s[n].w=g[a][b];
}
for(a=1;a<=m;a++)f[a]=a;
kruskal();
printf("%d\n",z);
}
return 0;   }


转载地址:https://blog.csdn.net/li412302070/article/details/12773721 如侵犯您的版权,请留言回复原文章的地址,我们会给您删除此文章,给您带来不便请您谅解!

上一篇:COGS 614 游历校园
下一篇:VIJOS 1371 方程的解

发表评论

最新留言

网站不错 人气很旺了 加油
[***.191.171.26]2022年08月18日 10时15分04秒

关于作者

    喝酒易醉,品茶养心,人生如梦,品茶悟道,何以解忧?唯有杜康!
-- 愿君每日到此一游!

最新文章