zoukankan      html  css  js  c++  java
  • HDOJ 4009 Transfer water 最小树形图



    Transfer water

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


    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   |   We have carefully selected several similar problems for you:  4007 4004 4006 4001 4008 
     


    /* ***********************************************
    Author        :CKboss
    Created Time  :2015年07月06日 星期一 09时23分30秒
    File Name     :HDOJ4009.cpp
    ************************************************ */
    
    #include <iostream>
    #include <cstdio>
    #include <cstring>
    #include <algorithm>
    #include <string>
    #include <cmath>
    #include <cstdlib>
    #include <vector>
    #include <queue>
    #include <set>
    #include <map>
    
    using namespace std;
    
    const int maxn=1200;
    const int INF=0x3f3f3f3f;
    
    int n,X,Y,Z;
    
    struct POS
    {
    	int a,b,c;
    }pos[maxn];
    
    struct Edge
    {
    	int u,v,cost;
    }edge[maxn*maxn];
    
    int en;
    int pre[maxn],id[maxn],vis[maxn],in[maxn];
    
    void init() { en=0; }
    
    int zhuliu(int root,int n,int m,Edge edge[])
    {
    	int res=0,v;
    	while(true)
    	{
    		for(int i=0;i<n;i++) in[i]=INF;
    		for(int i=0;i<m;i++)
    		{
    			if(edge[i].u!=edge[i].v&&edge[i].cost<in[edge[i].v])
    			{
    				pre[edge[i].v]=edge[i].u;
    				in[edge[i].v]=edge[i].cost;
    			}
    		}
    		for(int i=0;i<n;i++)
    		{
    			if(i!=root&&in[i]==INF) return -1;
    		}
    		int tn=0;
    		memset(id,-1,sizeof(id));
    		memset(vis,-1,sizeof(vis));
    		in[root]=0;
    		for(int i=0;i<n;i++)
    		{
    			res+=in[i];
    			v=i;
    			while(vis[v]!=i&&id[v]==-1&&v!=root)
    			{
    				vis[v]=i; v=pre[v];
    			}
    			if(v!=root&&id[v]==-1)
    			{
    				for(int u=pre[v];u!=v;u=pre[u])
    					id[u]=tn;
    				id[v]=tn++;
    			}
    		}
    		if(tn==0) break;
    		for(int i=0;i<n;i++)
    			if(id[i]==-1) id[i]=tn++;
    		for(int i=0;i<m;)
    		{
    			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[--m]);
    		}
    		n=tn;
    		root=id[root];
    	}
    	return res;
    }
    
    int main()
    {
    	//freopen("in.txt","r",stdin);
    	//freopen("out.txt","w",stdout);
    
    	while(scanf("%d%d%d%d",&n,&X,&Y,&Z)!=EOF)
    	{
    		if(n==0&&X==0&&Y==0&&Z==0) break;
    
    		init();
    
    		for(int i=1,x,y,z;i<=n;i++)
    		{
    			scanf("%d%d%d",&x,&y,&z);
    			pos[i]=(POS){x,y,z};
    		}
    
    		/// root 0 is water
    		for(int i=1;i<=n;i++)
    		{
    			int hight = pos[i].c;
    			edge[en++]=(Edge){0,i,hight*X};
    		}
    
    		for(int i=1,m;i<=n;i++)
    		{
    			int to,from=i;
    			scanf("%d",&m);
    			for(int j=0;j<m;j++)
    			{
    				scanf("%d",&to);
    				if(from==to) continue;
    
    				int dist = abs(pos[to].a-pos[from].a)+abs(pos[to].b-pos[from].b)+abs(pos[to].c-pos[from].c);
    				int h_to = pos[to].c;
    				int h_from = pos[from].c;
    
    				if(h_from>=h_to)
    				{
    					edge[en++]=(Edge){from,to,dist*Y};
    				}
    				else
    				{
    					edge[en++]=(Edge){from,to,dist*Y+Z};
    				}
    			}
    		}
    
    		/// zhuliu
    		int lens = zhuliu(0,n+1,en,edge);
    		if(lens==-1) puts("poor XiaoA");
    		else printf("%d
    ",lens);
    	}
        
        return 0;
    }
    



  • 相关阅读:
    seaborn基础整理
    matplotlib基础整理
    pandas基础整理
    numpy基础整理
    二分算法的应用——不只是查找值!
    二分算法的应用——Codevs 1766 装果子
    数据挖掘实战(二)—— 类不平衡问题_信用卡欺诈检测
    数论:素数判定
    MySQL学习(二)——MySQL多表
    MySQL学习(一)——Java连接MySql数据库
  • 原文地址:https://www.cnblogs.com/jhcelue/p/6984864.html
Copyright © 2011-2022 走看看