• <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>

            SRM 144 DIV 2 1100

            Problem Statement

                

            You work for an electric company, and the power goes out in a rather large apartment complex with a lot of irate tenants. You isolate the problem to a network of sewers underneath the complex with a step-up transformer at every junction in the maze of ducts. Before the power can be restored, every transformer must be checked for proper operation and fixed if necessary. To make things worse, the sewer ducts are arranged as a tree with the root of the tree at the entrance to the network of sewers. This means that in order to get from one transformer to the next, there will be a lot of backtracking through the long and claustrophobic ducts because there are no shortcuts between junctions. Furthermore, it's a Sunday; you only have one available technician on duty to search the sewer network for the bad transformers. Your supervisor wants to know how quickly you can get the power back on; he's so impatient that he wants the power back on the moment the technician okays the last transformer, without even waiting for the technician to exit the sewers first.

            You will be given three vector <int>'s: fromJunction , toJunction, and ductLength that represents each sewer duct. Duct i starts at junction (fromJunction[i] ) and leads to junction (toJunction[i]). ductlength[i] represents the amount of minutes it takes for the technician to traverse the duct connecting fromJunction[i] and toJunction[i]. Consider the amount of time it takes for your technician to check/repair the transformer to be instantaneous. Your technician will start at junction 0 which is the root of the sewer system. Your goal is to calculate the minimum number of minutes it will take for your technician to check all of the transformers. You will return an int that represents this minimum number of minutes.

            Definition

                
            Class: PowerOutage
            Method: estimateTimeOut
            Parameters: vector <int>, vector <int>, vector <int>
            Returns: int
            Method signature: int estimateTimeOut(vector <int> fromJunction, vector <int> toJunction, vector <int> ductLength)
            (be sure your method is public)

                題目意思:圖中有n個點,從邊(u,v)的權(quán)值是點u到點v所需的時間。現(xiàn)在需要遍歷圖中所有的點,問所需要的最少時間是多少。
                這類題目有一種一般的做法:設ans=2*∑cost(u,v),為所有邊的權(quán)值的和的2倍;再從起點s找一條簡單路徑path,滿足:path上的所有權(quán)值之和最大;這個可以用一個簡單的dfs輕松搞定;最后ans-path就是所需的最短時間。
            #include <iostream>
            #include 
            <vector>
            #include 
            <algorithm>
            using namespace std;

            class PowerOutage{
            public:
                
            int estimateTimeOut(vector<int> fromJunction, vector<int> toJunction, vector<int> ductLength);
                
            int dfs(int index, vector<int> fromJunction, vector<int> toJunction, vector<int> ductLength);
            }
            ;
            int PowerOutage::dfs(int index, vector<int> fromJunction, vector<int> toJunction, vector<int> ductLength){
                
            int i,ans=0,len=fromJunction.size();
                
            for(i=0;i<len;i++)
                    
            if(fromJunction[i]==index)
                        ans
            =max(ans,ductLength[i]+dfs(toJunction[i],fromJunction,toJunction,ductLength));
                
            return ans;
            }

            int PowerOutage::estimateTimeOut(vector<int> fromJunction, vector<int> toJunction, vector<int> ductLength){
                
            int i,ans=0,len=ductLength.size();
                
            for(i=0;i<len;i++)
                    ans
            +=2*ductLength[i];
                ans
            -=dfs(0,fromJunction,toJunction,ductLength);
                
            return ans;
            }

            posted on 2009-05-23 14:42 極限定律 閱讀(600) 評論(0)  編輯 收藏 引用 所屬分類: TopCoder

            <2009年5月>
            262728293012
            3456789
            10111213141516
            17181920212223
            24252627282930
            31123456

            導航

            統(tǒng)計

            常用鏈接

            留言簿(10)

            隨筆分類

            隨筆檔案

            友情鏈接

            搜索

            最新評論

            閱讀排行榜

            評論排行榜

            久久久久亚洲AV无码永不| 88久久精品无码一区二区毛片| 国产高潮久久免费观看| 很黄很污的网站久久mimi色| 久久国产精品偷99| 久久精品久久久久观看99水蜜桃| 久久国产色AV免费观看| 精品国产青草久久久久福利| 久久大香萑太香蕉av| 国产精品久久波多野结衣| 久久免费99精品国产自在现线| 思思久久99热只有频精品66| av无码久久久久不卡免费网站 | 99精品国产99久久久久久97| 久久综合香蕉国产蜜臀AV| 色综合久久中文综合网| 久久国产亚洲精品| 国产一区二区三区久久| 色天使久久综合网天天| 欧美精品一区二区精品久久 | 人妻系列无码专区久久五月天| 狠狠色丁香久久婷婷综合| 9191精品国产免费久久| 久久狠狠高潮亚洲精品| 综合久久一区二区三区 | 成人综合伊人五月婷久久| 国产精品久久久久久久人人看| 久久美女网站免费| 久久久老熟女一区二区三区| 久久天天躁狠狠躁夜夜avapp| 久久久久国产一区二区| 91久久精品电影| 精品久久久久久| av午夜福利一片免费看久久| 亚洲精品乱码久久久久久| 日韩欧美亚洲综合久久| 久久久国产视频| 99久久99久久精品国产片果冻| 欧美亚洲国产精品久久高清 | 亚洲精品无码久久久久| 国产精品中文久久久久久久|