POJ 1258 Agri-Net (最小生成树)

原创 2016年05月31日 15:05:57
Agri-Net
Time Limit: 1000MS Memory Limit: 10000K
Total Submissions: 49879 Accepted: 20738
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

4
0 4 9 21
4 0 8 17
9 8 0 16
21 17 16 0
Sample Output

28

题解:

最小生成树问题

代码:

#include <iostream>
#include <algorithm>
#include <cstdio>
#include <cstring>


using namespace std;
const int maxx=10005;
struct node
{
    int x;
    int y;
    int w;
}s[maxx];
int par[maxx];
int n;
int cmp(node a,node b)
{
    return a.w<b.w;
}
void init()
{
    for(int i=0;i<=n;i++)
        par[i]=i;
}
int find(int x)
{
    if(par[x]==x)
        return x;
    return par[x]=find(par[x]);
}
void unite(int x,int y)
{
    x=find(x);
    y=find(y);
    if(x!=y)
        par[y]=x;
        else
            return ;
}


int main()
{
    while(~scanf("%d",&n))
    {
        init();
        int a[105][105];
        for(int i=1;i<=n;i++)
        {
            for(int j=1;j<=n;j++)
            {
                scanf("%d",&a[i][j]);
            }
        }
        int k=0;
        for(int i=1;i<=n;i++)
        {
            for(int j=1;j<=n;j++)
            {
                s[k].x=i; //找各点之间的关系
                s[k].y=j;
                s[k++].w=a[i][j];
            }
        }
        sort(s,s+k,cmp);
        int coun=0;
        int sum=0;
        for(int i=0;i<k;i++)
        {
            node e=s[i];
            if(find(e.x)!=find(e.y))
            {
                coun++;
                unite(e.x,e.y);
                sum+=e.w;
            }
            if(coun>=n-1)
                break;
        }
        printf("%d\n",sum);
    }

    return 0;
}



POJ1258 Agri-Net 【最小生成树Prim】

Agri-Net Time Limit: 1000MS   Memory Limit: 10000K Total Submissions: 40889   Acce...

Agri-Net POJ - 1258 (最小生成树)

Agri-Net POJ - 1258 Farmer John has been elected mayor of his town! One of his campaign prom...

POJ 1258 Agri-Net 最小生成树 Prim

Agri-Net Time Limit: 1000MS   Memory Limit: 10000K Total Submissions: 36307   Accepted: 14598 ...
  • kdwycz
  • kdwycz
  • 2014年03月30日 15:37
  • 381

POJ_1258_Agri-Net(USACO 102)_最小生成树

此题为一道简单的最小生成树问题,输入一个 n*n 的邻接矩阵,然后在图上找最小生成树即可。我用Prim算法解的此题,算法思路也很简单,就是贪心。首先先随便把一个点加入到树中,然后不断地由此扩展其他的点...
  • NeoDQ
  • NeoDQ
  • 2016年06月15日 18:09
  • 180

POJ 1258 Agri-Net 最小生成树

题目大意: 给出n的地点,其中

POJ 1258 Agri-Net (最小生成树+Prim)

POJ 1258 Agri-Net (最小生成树+Prim)

POJ 1258:Agri-Net(最小生成树&&prim)

Agri-Net Time Limit: 1000MS   Memory Limit: 10000K Total Submissions: 38918  ...

poj 1258 Agri-Net (最小生成树 prim)

Agri-Net Time Limit: 1000MS   Memory Limit: 10000K Total Submissions: 39499   Accepted: 16017 ...

POJ1258 Agri-Net(Prim求解最小生成树)

 Description Farmer John has been elected mayor of his town! One of his campaign promises was to...

POJ 1258:Agri-Net Prim最小生成树模板题

Agri-Net Time Limit: 1000MS   Memory Limit: 10000K Total Submissions: 45050   Acce...
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:POJ 1258 Agri-Net (最小生成树)
举报原因:
原因补充:

(最多只允许输入30个字)