• <ins id="pjuwb"></ins>
    <blockquote id="pjuwb"><pre id="pjuwb"></pre></blockquote>
    <noscript id="pjuwb"></noscript>
          <sup id="pjuwb"><pre id="pjuwb"></pre></sup>
            <dd id="pjuwb"></dd>
            <abbr id="pjuwb"></abbr>

            USACO Section 3.1 Agri-Net

            Agri-Net

            Russ Cox

            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.

            PROGRAM NAME: agrinet

            INPUT FORMAT

            Line 1: The number of farms, N (3 <= N <= 100).
            Line 2..end: The subsequent lines contain the N x N connectivity 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.

            SAMPLE INPUT (file agrinet.in)

            4
            0 4 9 21
            4 0 8 17
            9 8 0 16
            21 17 16 0
            

            OUTPUT FORMAT

            The single output contains the integer length that is the sum of the minimum length of fiber required to connect the entire set of farms.

            SAMPLE OUTPUT (file agrinet.out)

            28
            Analysis

            A very traditional MST problem. Just use the Prim algorithm can get though it. Here I provide some simple descriptions about the Prim algorithm.
            The Prim algorithm plans to add a shortest path to the set A, which records the MST, and abandon the edge composed a cycle.

            Code

            /*
            ID:braytay1
            PROG:agrinet
            LANG:C++
            */

            #include 
            <iostream>
            #include 
            <fstream>
            using namespace std;
                
            int N;
            int map[101][101];
            int pi[101],key[101];
            bool Q[101];
            int min(int *a,bool *b){
                
            int res=10000000,mini;
                
            for (int i=0;i<N;i++){
                    
            if (res>*(a+i)&&*(b+i)==false{res=*(a+i);mini=i;}
                }

                
            return mini;
            }

            bool isempty(bool *a){
                
            for (int i=0;i<N;i++){
                    
            if (!*(a+i)) return false;
                }

                
            return true;
            }

            void prim(int g[101][101],int r){
                
            for (int u=0;u<N;u++){
                    key[u]
            =1000000;
                    pi[u]
            =0;
                    Q[u]
            =false;
                }

                key[r]
            =0;
                
            int u1;
                
            while (!isempty(Q)){
                    u1
            =min(key,Q);
                    Q[u1]
            =true;
                    
            for (int v=0;v<N;v++){
                        
            if (g[u1][v]&&Q[v]==false&&g[u1][v]<key[v]) {pi[v]=u1;key[v]=g[u1][v];}
                    }
                    
                }

            }

            int main(){
                ifstream fin(
            "agrinet.in");
                ofstream fout(
            "agrinet.out");
                fin
            >>N;
                
            for (int i=0;i<N;i++)
                    
            for (int j=0;j<N;j++){
                        fin
            >>map[i][j];
                    }

                prim(map,
            0);
                
            int res=0;
                
            for (int i=0;i<N;i++) res+=key[i];
                fout
            <<res<<endl;
                
            return 0;
            }


             

            posted on 2008-08-20 15:05 幻浪天空領主 閱讀(260) 評論(0)  編輯 收藏 引用 所屬分類: USACO

            <2025年7月>
            293012345
            6789101112
            13141516171819
            20212223242526
            272829303112
            3456789

            導航

            統計

            常用鏈接

            留言簿(1)

            隨筆檔案(2)

            文章分類(23)

            文章檔案(22)

            搜索

            最新評論

            閱讀排行榜

            評論排行榜

            一本色道久久88—综合亚洲精品| 久久影院午夜理论片无码| 久久99国产精品久久99小说| 亚洲国产精品高清久久久| 国产精品99久久久久久董美香 | 人妻久久久一区二区三区| 国产成人精品久久亚洲高清不卡 国产成人精品久久亚洲高清不卡 国产成人精品久久亚洲 | 久久综合亚洲鲁鲁五月天| 精品一二三区久久aaa片| 久久精品一区二区| 性做久久久久久久| 国产叼嘿久久精品久久| 中文字幕日本人妻久久久免费 | 伊人久久大香线蕉AV色婷婷色| 91精品国产综合久久婷婷| 久久这里都是精品| 久久久久久国产精品无码下载| 狠狠色丁香久久综合五月| 一97日本道伊人久久综合影院 | 精品伊人久久久| 91久久福利国产成人精品| 国产99久久久国产精免费| 天天躁日日躁狠狠久久| 香蕉久久夜色精品国产尤物| 国产精品99久久不卡| 久久综合九色综合97_久久久 | 久久久久久久亚洲Av无码| 久久九九精品99国产精品| 亚洲天堂久久久| 思思久久精品在热线热| 久久精品国产精品亚洲| 中文字幕成人精品久久不卡| 久久精品国产亚洲AV大全| 蜜臀av性久久久久蜜臀aⅴ麻豆 | 久久毛片免费看一区二区三区| 国产精品99久久精品| 97精品久久天干天天天按摩| 亚洲午夜久久久久久噜噜噜| 亚洲日本久久久午夜精品| 久久久久久久久久久精品尤物 | 99久久综合国产精品二区|