G - Agri-Net

最新推荐文章于 2021-07-27 09:17:43 发布

BUPT留白

最新推荐文章于 2021-07-27 09:17:43 发布

阅读量261

点赞数

CC 4.0 BY-SA版权

分类专栏： # 最小生成树

本文链接：https://blog.csdn.net/Mr_liubai/article/details/76678323

最小生成树专栏收录该内容

9 篇文章

订阅专栏

本文介绍了一种通过最小化光纤使用量来连接多个农场的算法解决方案，旨在帮助 Farmer John 实现其竞选承诺，即为所有农场提供互联网接入。该方案利用了图论中的最小生成树概念，通过输入各农场之间的连接成本矩阵，输出连接所有农场所需的最短光纤总长度。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

G - 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

#include <iostream>
#include <cstdio>
#include <algorithm>
using namespace std;
const int MAX=1e4+10;
int a[MAX][MAX];
int father[MAX];
void init(int n)
{
	for( int i = 0 ; i <= n ; i ++)
	  {
	  	   father[i] = i;
	  }
}
int find (int x)
{
	   if(x != father[x])
	   {
	   	 return father[x] = find(father[x]);
	   }
	  return x;
}
int unite(int a,int b)
{
	  int fa = find(a);
	  int fb = find(b);
	  if( fa != fb)
	  {
	  	   father[fa] = fb;
	  	   return 1;
	  }
	  return 0;
}
struct node 
{
	int st;
	int endd;
	int cost;
}p[MAX];
bool cmp(node a,node b)
{
	return a.cost<b.cost;
}
int main()
{

   	  int n;
   	  while(~scanf("%d",&n))
   	  {
   	  init(n);
   	  int ans=-1;
   	for(int i = 1 ; i <= n ; i++)
   	       for(int j = 1 ; j <= n ; j++)
   	      { 
   	              scanf("%d",&a[i][j]);
   	              if(i<j)
   	              {   
   	                    ans++;
   	              	    p[ans].st = i;
   	              	    p[ans].endd=j;
   	              	    p[ans].cost = a[i][j];
   	              	    
					 }
		 }
		 sort (p , p+ans+1,cmp);
		 int t=0  , sum=0;
		 for(int i=0 ; i<= ans; i++)
		 {
		 	  if(unite(p[i].st,p[i].endd))
		 	  {
		 	  	  sum += p[i].cost;
		 	  	  t++;
			   }
		 	if(t == n-1)
		 	break;
		 }
   	     printf("%d\n",sum);
 }	
	
	return 0;
}