首先明确一点,这道题目是肯定有解的,也就是说题目中说的“If the plan does not exist, print “poor XiaoA” in one line. ”,是不存在的,因为无论如何,每家都可以自己挖一口井喝水用。
从题目中的信息中抽象出最小树形图的思想:A可以给B供水,那么A->B就存在一条有向边;如果S点挖了一口井,他就可以作为一棵树形图的树根。由于谁是树根,共有多少个树根都是没有定的,所以我们在图中需要添加一个超级节点,它与每家之间都有一条有向边,以这个超级节点建树形图即可。这条有向边的权值就是这家自己挖井所需的费用,也就是X*这家的高度。如果两家之间的有向边(设为A->B),如果A高于B或者与B等高,边权为Y*曼哈顿距离;如果A低于B,那么边权为Y*曼哈顿距离+Z。
代码如下
#include<cstdio>
#include<climits>
#include<cmath>
#include<cstring>
#include<algorithm>
#define inf INT_MAX
#define maxn 1005
#define maxm 1010025
using namespace std;
struct Edge
{
int u, v, cost;
} edge[maxm];
int pre[maxn], in[maxn], xyz[maxn][3],x,y,z,id[maxn],vis[maxn];
inline int cal(int a, int b)
{
if (xyz[a][2] >= xyz[b][2]) return y * (abs(xyz[a][0] - xyz[b][0]) + abs(xyz[a][1] - xyz[b][1])+abs(xyz[a][2]-xyz[b][2]));
return y * (abs(xyz[a][0] - xyz[b][0]) + abs(xyz[a][1] - xyz[b][1]) + abs(xyz[a][2] - xyz[b][2]))+z;
}
int zhuliu(int root, int vnum, int ednum)
{
int res = 0, v, tn;
while (1)
{
for (int i = 0; i < vnum; i++)
in[i] = inf;
for(int i=0;i<ednum;i++)
if (edge[i].cost < in[edge[i].v])
{
pre[edge[i].v] = edge[i].u;
in[edge[i].v] = edge[i].cost;
}
tn=in[root] = 0;
memset(id, -1, sizeof(id));
memset(vis, -1, sizeof(vis));
for (int i = 0; i < vnum; i++)
{
v = i;
res += in[i];
while (vis[v] != i && id[v] == -1 && v != root)
{
vis[v] = i;
v = pre[v];
}
if (vis[v] == i)
{
for (int u = pre[v]; u != v; u = pre[u])
id[u] = tn;
id[v] = tn++;
}
}
if (!tn) break;
for (int i = 0; i < vnum; i++)
if (id[i] == -1)
id[i] = tn++;
for (int i = 0; i < ednum;)
{
v = edge[i].v;
edge[i].u = id[edge[i].u];
edge[i].v = id[edge[i].v];
if (edge[i].u != edge[i].v)
edge[i++].cost -= in[v];
else
swap(edge[i], edge[--ednum]);
}
vnum = tn;
root = id[root];
}
return res;
}
int main()
{
int n,cnt;
while (scanf("%d%d%d%d", &n, &x, &y, &z) && (x || y || z || n))
{
for (int i = 1; i <= n; i++)
for (int j = 0; j < 3; j++)
scanf("%d", &xyz[i][j]);
cnt = 0;
for (int i = 1, k,v; i <= n; i++)
{
scanf("%d", &k);
for (int j = 0; j < k; j++)
{
scanf("%d", &v);
if (v != i)//确保没有自环
{
edge[cnt].u = i;
edge[cnt].v = v;
edge[cnt++].cost = cal(i, v);
}
}
}
for (int i = cnt; i < cnt+n; i++)//从超级节点向每个点添加边
{
edge[i].u = 0;
edge[i].v = i + 1 - cnt;
edge[i].cost = x*abs(xyz[i+1-cnt][2]);
}
printf("%d\n",zhuliu(0, n + 1, n + cnt));
}
return 0;
}