• <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>
            posts - 7,comments - 3,trackbacks - 0

            Transfer water

            Time Limit: 5000/3000 MS (Java/Others)    Memory Limit: 65768/65768 K (Java/Others)
            Total Submission(s): 1770    Accepted Submission(s): 650


            Problem Description
            XiaoA lives in a village. Last year flood rained the village. So they decide to move the whole village to the mountain nearby this year. There is no spring in the mountain, so each household could only dig a well or build a water line from other household. If the household decide to dig a well, the money for the well is the height of their house multiplies X dollar per meter. If the household decide to build a water line from other household, and if the height of which supply water is not lower than the one which get water, the money of one water line is the Manhattan distance of the two households multiplies Y dollar per meter. Or if the height of which supply water is lower than the one which get water, a water pump is needed except the water line. Z dollar should be paid for one water pump. In addition,therelation of the households must be considered. Some households may do not allow some other households build a water line from there house. Now given the 3‐dimensional position (a, b, c) of every household the c of which means height, can you calculate the minimal money the whole village need so that every household has water, or tell the leader if it can’t be done.
             

            Input
            Multiple cases. 
            First line of each case contains 4 integers n (1<=n<=1000), the number of the households, X (1<=X<=1000), Y (1<=Y<=1000), Z (1<=Z<=1000). 
            Each of the next n lines contains 3 integers a, b, c means the position of the i‐th households, none of them will exceeded 1000. 
            Then next n lines describe the relation between the households. The n+i+1‐th line describes the relation of the i‐th household. The line will begin with an integer k, and the next k integers are the household numbers that can build a water line from the i‐th household. 
            If n=X=Y=Z=0, the input ends, and no output for that. 
             

            Output
            One integer in one line for each case, the minimal money the whole village need so that every household has water. If the plan does not exist, print “poor XiaoA” in one line. 
             

            Sample Input
            2 10 20 30 1 3 2 2 4 1 1 2 2 1 2 0 0 0 0
             

            Sample Output
            30
            Hint
            In 3‐dimensional space Manhattan distance of point A (x1, y1, z1) and B(x2, y2, z2) is |x2‐x1|+|y2‐y1|+|z2‐z1|.
             

            Source
             

            Recommend
            lcy
             

            今年大連賽區網絡賽一道題.....我怎么一點印象也沒有呢.....
            一道赤裸的最小樹形圖,除了數據有點大而已.....
            思路:因為沒有根,所以虛擬一個根,所有點和這個根連線,權值是該點造井的價格,這樣以這個根出發,構造出來的最小樹形圖就是最小的費用了。
            代碼:
            #include <cstdio>
            #include 
            <cstring>
            #include 
            <cmath>
            #include 
            <iostream>
            using namespace std;

            const int maxn = 1100;
            const int maxm = 1100000;
            const int maxint = 0x3fffffff;

            struct edge
            {
                
            int u, v, w;
                edge(){}
                edge(
            int u1, int v1, int w1) : u(u1), v(v1), w(w1){}
            } e[maxm];

            int root, n, edgeNum, vis[maxn], pre[maxn], belong[maxn], in[maxn];
            int a[maxn], b[maxn], c[maxn];
            int Abs(int a)
            {
                
            return a > 0 ? a : -a;
            }

            int Dis(int i, int j)
            {
                
            return Abs(a[i] - a[j]) + Abs(b[i] - b[j]) + Abs(c[i] - c[j]);
            }

            int solve()
            {
                
            int i, j, k, num, sum = 0;
                n
            ++;
                
            while (1)
                {
                    
            for (i = 0; i < n; ++i)
                        
            in[i] = maxint;
                    
            for (i = 0; i < edgeNum; ++i)
                    {
                        
            if (in[e[i].v] > e[i].w && e[i].u != e[i].v)
                        {
                            pre[e[i].v] 
            = e[i].u;
                            
            in[e[i].v] = e[i].w;
                        }
                    }

                    memset(vis, 
            -1sizeof(vis));
                    memset(belong, 
            -1sizeof(belong));
                    
            in[root] = 0;
                    
            for (num = 0, i = 0; i < n; ++i)
                    {
                        sum 
            += in[i];
                        j 
            = i;
                        
            while (vis[j] != i && belong[j] == -1 && j != root)
                        {
                            vis[j] 
            = i;
                            j 
            = pre[j];
                        }
                        
            if (vis[j] == i)
                        {
                            
            for (k = pre[j]; k != j; k = pre[k])
                                belong[k] 
            = num;
                            belong[j] 
            = num++;
                        }
                    }

                    
            if (!num) return sum;
                    
            for (i = 0; i < n; ++i)
                        
            if (belong[i] == -1)
                            belong[i] 
            = num++;

                    
            for (i = 0; i < edgeNum; ++i)
                    {
                        
            int j = e[i].v;
                        e[i].u 
            = belong[e[i].u];
                        e[i].v 
            = belong[e[i].v];
                        e[i].w 
            -= in[j];
                    }
                    n 
            = num;
                    root 
            = belong[root];
                }
                
            return sum;
            }

            int main()
            {
                
            int x, y, z, i, j, k, ii, d;
                
            while (scanf("%d%d%d%d"&n, &x, &y, &z) != EOF)
                {
                    
            if (!&& !&& !&& !z) break;
                    
            for (edgeNum = 0, i = 1; i <= n; ++i)
                    {
                        scanf(
            "%d%d%d"&a[i], &b[i], &c[i]);
                        e[edgeNum
            ++= edge(0, i, c[i] * x);
                    }
                    
            for (i = 1; i <= n; ++i)
                    {
                        scanf(
            "%d"&k);
                        
            while (k--)
                        {
                            scanf(
            "%d"&ii);
                            
            if (i == ii) continue;
                            d 
            = Dis(i, ii);
                            
            if (c[i] >= c[ii])
                                e[edgeNum
            ++= edge(i, ii, d * y);
                            
            else
                                e[edgeNum
            ++= edge(i, ii, d * y + z);
                        }
                    }

                    root 
            = 0;
                    printf(
            "%d\n", solve());
                }
                
            return 0;
            }
            posted on 2011-10-15 22:20 LLawliet 閱讀(231) 評論(0)  編輯 收藏 引用 所屬分類: 圖論
            伊人久久成人成综合网222| 亚洲狠狠婷婷综合久久蜜芽 | 精品久久久久久无码人妻蜜桃| 97久久精品午夜一区二区| 丰满少妇人妻久久久久久4| 久久久久国产精品三级网| 欧美日韩久久中文字幕| 亚洲AV日韩精品久久久久久| 青青青国产成人久久111网站| 久久91精品国产91| 88久久精品无码一区二区毛片| 中文字幕精品无码久久久久久3D日动漫 | 久久综合九色综合久99| 久久久久久国产a免费观看黄色大片 | 精品久久久久久久久免费影院| 97精品国产91久久久久久| 一本久久免费视频| 久久不射电影网| 久久亚洲中文字幕精品有坂深雪| 狠狠精品干练久久久无码中文字幕| 中文精品久久久久人妻不卡| 国产巨作麻豆欧美亚洲综合久久| 亚洲精品国产美女久久久| 欧美国产成人久久精品| 久久有码中文字幕| 91精品国产91久久久久久蜜臀| 色综合久久无码五十路人妻| 亚洲中文字幕伊人久久无码| 香港aa三级久久三级| 久久精品毛片免费观看| 久久人人添人人爽添人人片牛牛| 理论片午午伦夜理片久久| 久久久久久av无码免费看大片| 99久久亚洲综合精品网站| 99热成人精品热久久669| 久久久精品人妻一区二区三区四| 777午夜精品久久av蜜臀| 亚洲国产精品无码久久久秋霞2 | 区亚洲欧美一级久久精品亚洲精品成人网久久久久 | 久久久久久午夜成人影院| 午夜不卡久久精品无码免费|