zoukankan      html  css  js  c++  java
  • POJ 1258, AgriNet

    Time Limit: 1000MS  Memory Limit: 10000K
    Total Submissions: 11276  Accepted: 4707


    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

    Source
    USACO 102


    // POJ1258.cpp : Defines the entry point for the console application.
    //

    #include 
    <iostream>
    #include 
    <numeric>
    using namespace std;

    int main(int argc, char* argv[])
    {
        
    int N;
        
    int d[101][101];
        
    bool used[101];
        
    int l[101];
        
    while (cin >> N && N != 0)
        {
            
    for (int i = 0; i < N; ++i)
                
    for (int j = 0; j < N; ++j)
                    cin 
    >>d[i][j];

            
    for (int i = 0; i < N; ++i) l[i] = d[0][i];
            used[
    0= true;
            memset(used, 
    0sizeof(used));

            
    for (int i = 0; i < N; ++i)
            {
                
    int len = 100000;
                
    int pos = 0;
                
                
    for (int j = 0; j < N; ++j)
                    
    if (used[j] == false && l[j] < len)
                    {
                        len 
    = l[j];
                        pos 
    = j;
                    };

                used[pos] 
    = true;

                
    for (int j = 0; j < N; ++j)
                    
    if (used[j] == false && l[j] > d[pos][j]) l[j] = d[pos][j];
            }

            cout 
    << accumulate(&l[0], &l[N], 0<<endl;
        }
        
    return 0;
    }

  • 相关阅读:
    【插队问题-线段树-思维巧妙】【poj2828】Buy Tickets
    【线段树成段更新成段查询模板】【POJ3468】A Simple Problem with Integerst
    HDU 6156 Palindrome Function 数位DP
    HDU 6154 CaoHaha's staff 思维 找规律
    Educational Codeforces Round 18 A B 码力 比赛
    Codeforces 815 B Karen and Test 杨辉三角 组合数学
    Codeforces 815 A Karen and Game 贪心
    POJ 1006 Biorhythms 中国剩余定理 数论
    Codeforces 818 E Card Game Again 线段树 思维
    Educational Codeforces Round 24-A B C D 思维
  • 原文地址:https://www.cnblogs.com/asuran/p/1577158.html
Copyright © 2011-2022 走看看