Agri-Net POJ - 1258 （最小生成树）

Guuuuuu老师儿

墨衍会员 · AI 创作全网分发码龄9年

关注

原创最新推荐文章于 2020-02-20 17:46:25 发布 612 阅读 AI 写同款· GEO 优化 ›

AI权益加码！Claude Code、Cursor等20+工具免费用！购周边限时加赠Coding Plan Lite，畅享主流AI工具！学习进阶更高效！阅读详情

Agri-Net

POJ - 1258

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

code：

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
int G[105][105];
int n;
struct node{
    int from,to;
    int len;
}farm[10005];
bool cmp(node a,node b){
    return a.len < b.len;
}
int pre[105];
int Find(int x){
    if(x == pre[x])
        return x;
    else return pre[x] = Find(pre[x]);
}
int Union(int x,int y){
    int fx = Find(x),fy = Find(y);
    if(fx == fy)
        return 0;
    else{
        pre[fy] = fx;
        return 1;
    }
}
int main(){
    while(~scanf("%d",&n)){
        int i,j;
        for(i = 0; i < 105; i++)
            pre[i] = i;
        int cnt = 0;
        for(i = 0; i < n; i++){
            for(j = 0; j < n; j++){
                scanf("%d",&G[i][j]);
                if(G[i][j] != 0){
                    farm[cnt].from = i;
                    farm[cnt].to = j;
                    farm[cnt++].len = G[i][j];
                }
            }
        }
        sort(farm,farm+cnt,cmp);
        int num = 0;
        int sum = 0;
        for(i = 0; i < cnt; i++){
            if(Union(farm[i].from,farm[i].to)){
                sum += farm[i].len;
                num++;
            }
            if(num == n-1)
                break;
        }
        cout << sum << endl;
    }
    return 0;
}