最小树形图
来源:互联网 发布:linux查看端口是否打开 编辑:程序博客网 时间:2024/04/27 15:15
Transfer water
Time Limit: 5000/3000 MS (Java/Others) Memory Limit: 65768/65768 K (Java/Others)Total Submission(s): 3893 Accepted Submission(s): 1397
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.
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 301 3 22 4 11 22 1 20 0 0 0
Sample Output
30HintIn 3‐dimensional space Manhattan distance of point A (x1, y1, z1) and B(x2, y2, z2) is |x2‐x1|+|y2‐y1|+|z2‐z1|.#include <iostream>#include <cstring>#include <cstdio>#include <cmath>using namespace std;const int maxn = 1005;const int maxe = 1000000;const int inf = 0x7fffffff;struct node{ int u, v, cost;}edge[maxe];struct point{ int x, y, h;}p[maxn];int x, y, z;int pre[maxn], ind[maxn], id[maxn], vis[maxn];int get_p(int u, int v){ int cost = 0; cost += (abs(p[u].x-p[v].x)+abs(p[u].y-p[v].y)+abs(p[u].h-p[v].h))*y; if (p[u].h < p[v].h) cost += z; return cost;}int zhuliu(int root, int n, int m){ int res = 0, idx, s, t; while (true) { for (int i = 0; i < n; i ++) ind[i] = inf; for (int i = 0; i < m; i ++) { s = edge[i].u; t = edge[i].v; if (edge[i].cost < ind[t] && s != t) { ind[t] = edge[i].cost; pre[t] = s; } } ind[root] = 0; for (int i = 0; i < n; i ++) if (ind[i] == inf) return -1; idx = 0; for (int i = 0; i < n; i ++) vis[i] = -1, id[i] = -1; for (int i = 0; i < n; i ++) { res += ind[i]; s = i; while (vis[s] != i && id[s] == -1 && s != root) { vis[s] = i; s = pre[s]; } if (s != root && id[s] == -1) { for (t = pre[s]; t != s; t = pre[t]) { id[t] = idx; } id[t] = idx++; } } //cout <<"res="<<res<<endl; if (idx == 0) break; for (int i = 0; i < n; i ++) if (id[i]== -1) id[i] = idx++; for (int i = 0; i < m; i ++) { t = 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 -= ind[t]; } } n = idx; root = id[root]; } return res;}int main() { int n, num; while (scanf("%d%d%d%d", &n, &x, &y, &z), x+y+z+n) { for (int i = 1; i <= n; i ++) { scanf("%d%d%d", &p[i].x, &p[i].y, &p[i].h); } int temp, u, v; num = 0; for (int i = 1; i <= n; i ++) { scanf("%d", &temp); for (int j = 1; j <= temp; j ++) { scanf("%d", &v); if (u != i) { edge[num].u = i; edge[num].v = v; edge[num].cost = get_p(i, v); num ++; } } } for (int i = 1; i <= n; i ++) { edge[num].u = 0; edge[num].v = i; edge[num].cost = (p[i].h)*x; num ++; } int ans = zhuliu(0, n+1, num); if (ans == -1) printf("poor XiaoA\n"); else printf("%d\n", ans); }return 0;}
0 0
- 【最小树形图】最小树形图复习
- 最小树形图
- 最小树形图
- 最小树形图
- 最小树形图
- 最小树形图
- POJ_3164 最小树形图
- 最小树形图poj3164
- 最小树形图
- 最小树形图
- 最小树形图
- 最小树形图
- POJ3164-最小树形图
- 最小树形图
- 最小树形图
- 【最小树形图】
- 最小树形图
- 最小树形图
- HDU-5077-NAND(DFS+打表)
- SOCKET编程
- ASP.NET基础教程-Calendar日期选择控件的使用
- cocos2d-x实现node圆弧运动 (附源代码)
- STM32Fxx FreeRTOS学习一
- 最小树形图
- leetcode - Search for a Range
- Unity3d NGUI的使用(二)(UILabel中文字体及可点击的字体)
- JQuery ajax请求struts action实现异步刷新的小实例
- java常用jar包
- 第九周项目3.1 输出点阵1
- 实现windows系统和虚拟机VMware上linux系统上文件的互传
- wince启动增加进度条
- 难友彭旭受脑控武器迫害的经过