Transfer water

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

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

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

The 36th ACM/ICPC Asia Regional Dalian Site —— Online Contest

题解：

1.可知这题肯定有解，因为大不了每一户都自己挖口井。

2.题目其实就是要求：最小树形图的森林。因此我们不能确定根节点，因为根节点可以有多个，那怎么办呢？

3.设置一个超级点，作为虚拟的根节点。把这个超级点连向每一个题目中的点。然后再用此超级点去跑zhuliu算法，得到一个最小树形图（智能的超级点，好评）。可知把超级点去掉后，就是我们要求的最小树形图的森林（当然我们不需要这样做，这里只是方便理解）。

代码一：

  1 #include <iostream>
  2 #include <cstdio>
  3 #include <algorithm>
  4 #include <cstring>
  5 #include <cmath>
  6 using namespace std;
  7 typedef long long LL;
  8 const double EPS = 1e-6;
  9 const int INF = 2e9;
 10 const LL LNF = 9e18;
 11 const int MOD = 1e9+7;
 12 const int MAXM = 1e6+10;
 13 const int MAXN = 1e3+10;
 14 
 15 struct Edge
 16 {
 17     int u, v, w;
 18 }edge[MAXM];
 19 
 20 int x[MAXN], y[MAXN], z[MAXN];
 21 int pre[MAXN], id[MAXN], vis[MAXN], in[MAXN];
 22 
 23 int zhuliu(int root, int n, int m)
 24 {
 25     int res = 0;
 26     while(true)
 27     {
 28         for(int i = 0; i<n; i++)
 29             in[i] = INF;
 30         for(int i = 0; i<m; i++)
 31         if(edge[i].u!=edge[i].v && edge[i].w<in[edge[i].v])
 32         {
 33             pre[edge[i].v] = edge[i].u;
 34             in[edge[i].v] = edge[i].w;
 35         }
 36 
 37         for(int i = 0; i<n; i++)
 38             if(i!=root && in[i]==INF)
 39                 return -1;
 40 
 41         int tn = 0;
 42         memset(id, -1, sizeof(id));
 43         memset(vis, -1, sizeof(vis));
 44         in[root] = 0;
 45         for(int i = 0; i<n; i++)
 46         {
 47             res += in[i];
 48             int v = i;
 49             while(vis[v]!=i && id[v]==-1 && v!=root)
 50             {
 51                 vis[v] = i;
 52                 v = pre[v];
 53             }
 54             if(v!=root && id[v]==-1)
 55             {
 56                 for(int u = pre[v]; u!=v; u = pre[u])
 57                     id[u] = tn;
 58                 id[v] = tn++;
 59             }
 60         }
 61         if(tn==0) break;
 62         for(int i = 0; i<n; i++)
 63             if(id[i]==-1)
 64                 id[i] = tn++;
 65 
 66         for(int i = 0;  i<m; )
 67         {
 68             int v = edge[i].v;
 69             edge[i].u = id[edge[i].u];
 70             edge[i].v = id[edge[i].v];
 71             if(edge[i].u!=edge[i].v)
 72                 edge[i++].w -= in[v];
 73             else
 74                 swap(edge[i], edge[--m]);
 75         }
 76         n = tn;
 77         root = id[root];
 78     }
 79     return res;
 80 }
 81 
 82 int main()
 83 {
 84     int n, m, X, Y, Z;
 85     while(scanf("%d%d%d%d", &n, &X, &Y, &Z)!=EOF)
 86     {
 87         if(!n && !X && !Y && !Z) break;
 88 
 89         for(int i = 0; i<n; i++)
 90             scanf("%d%d%d", &x[i], &y[i], &z[i]);
 91 
 92         m = 0;
 93         for(int i = 0; i<n; i++)
 94         {
 95             int num, v;
 96             scanf("%d", &num);
 97             while(num--)
 98             {
 99                 scanf("%d", &v); v--;
100                 edge[m].u = i;
101                 edge[m].v = v;
102                 edge[m].w = Y*(abs(x[i]-x[v])+abs(y[i]-y[v])+abs(z[i]-z[v]));
103                 if(z[i]<z[v]) edge[m].w += Z;
104                 m++;
105             }
106             //0~n-1为题目中的点， n为人工设置的超级点
107             //将超级点连到每一个结点，并且设置相应的权值
108             edge[m].u = n;
109             edge[m].v = i;
110             edge[m++].w = z[i]*X;
111         }
112 
113         int ans = zhuliu(n, n+1, m);
114         printf("%d
", ans);
115     }
116 }

View Code

代码二：

  1 #include <iostream>
  2 #include <cstdio>
  3 #include <algorithm>
  4 #include <cstring>
  5 #include <cmath>
  6 using namespace std;
  7 typedef long long LL;
  8 const double EPS = 1e-6;
  9 const int INF = 2e9;
 10 const LL LNF = 9e18;
 11 const int MOD = 1e9+7;
 12 const int MAXM = 1e6+10;
 13 const int MAXN = 1e3+10;
 14 
 15 struct Edge
 16 {
 17     int u, v, w;
 18 }edge[MAXM];
 19 
 20 int x[MAXN], y[MAXN], z[MAXN];
 21 int pre[MAXN], id[MAXN], vis[MAXN], in[MAXN];
 22 
 23 int zhuliu(int root, int n, int m)
 24 {
 25     int res = 0;
 26     while(true)
 27     {
 28         for(int i = 0; i<n; i++)
 29             in[i] = INF;
 30         for(int i = 0; i<m; i++)
 31         if(edge[i].u!=edge[i].v && edge[i].w<in[edge[i].v])
 32         {
 33             pre[edge[i].v] = edge[i].u;
 34             in[edge[i].v] = edge[i].w;
 35         }
 36 
 37         for(int i = 0; i<n; i++)
 38             if(i!=root && in[i]==INF)
 39                 return -1;
 40 
 41         int tn = 0;
 42         memset(id, -1, sizeof(id));
 43         memset(vis, -1, sizeof(vis));
 44         in[root] = 0;
 45         for(int i = 0; i<n; i++)
 46         {
 47             res += in[i];
 48             int v = i;
 49             while(vis[v]!=i && id[v]==-1 && v!=root)
 50             {
 51                 vis[v] = i;
 52                 v = pre[v];
 53             }
 54             if(v!=root && id[v]==-1)
 55             {
 56                 for(int u = pre[v]; u!=v; u = pre[u])
 57                     id[u] = tn;
 58                 id[v] = tn++;
 59             }
 60         }
 61         if(tn==0) break;
 62         for(int i = 0; i<n; i++)
 63             if(id[i]==-1)
 64                 id[i] = tn++;
 65 
 66         for(int i = 0;  i<m; i++)
 67         {
 68             int v = edge[i].v;
 69             edge[i].u = id[edge[i].u];
 70             edge[i].v = id[edge[i].v];
 71             if(edge[i].u!=edge[i].v)
 72                 edge[i].w -= in[v];
 73         }
 74         n = tn;
 75         root = id[root];
 76     }
 77     return res;
 78 }
 79 
 80 int main()
 81 {
 82     int n, m, X, Y, Z;
 83     while(scanf("%d%d%d%d", &n, &X, &Y, &Z)!=EOF)
 84     {
 85         if(!n && !X && !Y && !Z) break;
 86 
 87         for(int i = 0; i<n; i++)
 88             scanf("%d%d%d", &x[i], &y[i], &z[i]);
 89 
 90         m = 0;
 91         for(int i = 0; i<n; i++)
 92         {
 93             int num, v;
 94             scanf("%d", &num);
 95             while(num--)
 96             {
 97                 scanf("%d", &v); v--;
 98                 edge[m].u = i;
 99                 edge[m].v = v;
100                 edge[m].w = Y*(abs(x[i]-x[v])+abs(y[i]-y[v])+abs(z[i]-z[v]));
101                 if(z[i]<z[v]) edge[m].w += Z;
102                 m++;
103             }
104             //0~n-1为题目中的点， n为人工设置的超级点
105             //将超级点连到每一个结点，并且设置相应的权值
106             edge[m].u = n;
107             edge[m].v = i;
108             edge[m++].w = z[i]*X;
109         }
110 
111         int ans = zhuliu(n, n+1, m);
112         printf("%d
", ans);
113     }
114 }

View Code