POJ 1258 Agri-Net

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

花飞雨追

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

阅读量187

点赞数

分类专栏：图论-Kruskal 文章标签： poj

本文链接：https://blog.csdn.net/qq_36258516/article/details/78533879

版权

图论-Kruskal 专栏收录该内容

11 篇文章 0 订阅

订阅专栏

Agri-Net

Time Limit: 1000MS		Memory Limit: 10000K
Total Submissions: 62446		Accepted: 25833

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

题意：

给出一个邻接矩阵，求最小生成树。

解题思路：

裸kruskal算法。

#include<stdio.h>
#include<algorithm>
#include<iostream>
using namespace std;
#define maxn 105

struct road
{
    int from,to,val;
} arr[maxn*maxn];
int pic[maxn][maxn];
int p[maxn];
int n,sum;

int cmp(road a,road b)
{
    return a.val<b.val;
}

int find(int x)
{
    return p[x]==x?x:find(p[x]);
}

int kruskal()
{
    for(int i=0; i<n; i++)
        p[i]=i;
    int ans=0,cnt=0;
    for(int i=0; i<sum; i++)
    {
        int x=find(arr[i].from);
        int y=find(arr[i].to);
        if(x!=y)
        {
            ans+=arr[i].val;
            p[x]=y;
            cnt++;
        }
        if(cnt==n-1) return ans;
    }
}
int main()
{
    //freopen("in.txt","r",stdin);
    while(~scanf("%d",&n))
    {
        sum=0;
        for(int i=0; i<n; i++)
            for(int j=0; j<n; j++)
                scanf("%d",&pic[i][j]);
        for(int i=0; i<n; i++)
            for(int j=0; j<i; j++)
            {
                arr[sum].from=i;
                arr[sum].to=j;
                arr[sum++].val=pic[i][j];
            }
        sort(arr,arr+sum,cmp);
        printf("%d\n",kruskal());
    }
    return 0;
}