poj 1459
来源:互联网 发布:如何注册两个淘宝账号 编辑:程序博客网 时间:2024/05/22 01:37
A power network consists of nodes (power stations, consumers and dispatchers) connected by power transport lines. A node u may be supplied with an amount s(u) >= 0 of power, may produce an amount 0 <= p(u) <= pmax(u) of power, may consume an amount 0 <= c(u) <= min(s(u),cmax(u)) of power, and may deliver an amount d(u)=s(u)+p(u)-c(u) of power. The following restrictions apply: c(u)=0 for any power station, p(u)=0 for any consumer, and p(u)=c(u)=0 for any dispatcher. There is at most one power transport line (u,v) from a node u to a node v in the net; it transports an amount 0 <= l(u,v) <= lmax(u,v) of power delivered by u to v. Let Con=Σ uc(u) be the power consumed in the net. The problem is to compute the maximum value of Con.
An example is in figure 1. The label x/y of power station u shows that p(u)=x and pmax(u)=y. The label x/y of consumer u shows that c(u)=x and cmax(u)=y. The label x/y of power transport line (u,v) shows that l(u,v)=x and lmax(u,v)=y. The power consumed is Con=6. Notice that there are other possible states of the network but the value of Con cannot exceed 6.
An example is in figure 1. The label x/y of power station u shows that p(u)=x and pmax(u)=y. The label x/y of consumer u shows that c(u)=x and cmax(u)=y. The label x/y of power transport line (u,v) shows that l(u,v)=x and lmax(u,v)=y. The power consumed is Con=6. Notice that there are other possible states of the network but the value of Con cannot exceed 6.
Input
There are several data sets in the input. Each data set encodes a power network. It starts with four integers: 0 <= n <= 100 (nodes), 0 <= np <= n (power stations), 0 <= nc <= n (consumers), and 0 <= m <= n^2 (power transport lines). Follow m data triplets (u,v)z, where u and v are node identifiers (starting from 0) and 0 <= z <= 1000 is the value of lmax(u,v). Follow np doublets (u)z, where u is the identifier of a power station and 0 <= z <= 10000 is the value of pmax(u). The data set ends with nc doublets (u)z, where u is the identifier of a consumer and 0 <= z <= 10000 is the value of cmax(u). All input numbers are integers. Except the (u,v)z triplets and the (u)z doublets, which do not contain white spaces, white spaces can occur freely in input. Input data terminate with an end of file and are correct.
Output
For each data set from the input, the program prints on the standard output the maximum amount of power that can be consumed in the corresponding network. Each result has an integral value and is printed from the beginning of a separate line.
Sample Input
2 1 1 2 (0,1)20 (1,0)10 (0)15 (1)207 2 3 13 (0,0)1 (0,1)2 (0,2)5 (1,0)1 (1,2)8 (2,3)1 (2,4)7 (3,5)2 (3,6)5 (4,2)7 (4,3)5 (4,5)1 (6,0)5 (0)5 (1)2 (3)2 (4)1 (5)4
Sample Output
156
Hint
The sample input contains two data sets. The first data set encodes a network with 2 nodes, power station 0 with pmax(0)=15 and consumer 1 with cmax(1)=20, and 2 power transport lines with lmax(0,1)=20 and lmax(1,0)=10. The maximum value of Con is 15. The second data set encodes the network from figure 1.
这个题不是一般的坑啊,格式问题
#include <iostream>#include <stdio.h>using namespace std;const int oo=1e9;const int mm=111111;const int mn=999;int node,scr,dest,edge;int ver[mm],flow[mm],next[mm];int head[mn],work[mn],dis[mn],q[mn];void prepare(int _node,int _scr,int _dest){ node=_node,scr=_scr,dest=_dest; for(int i=0;i<node;++i) head[i]=-1; edge=0;}void addedge(int u,int v,int c){ ver[edge]=v,flow[edge]=c,next[edge]=head[u],head[u]=edge++; ver[edge]=u,flow[edge]=0,next[edge]=head[v],head[v]=edge++;}bool Dinic_bfs(){ int i,u,v,l,r=0; for(i=0;i<node;i++) dis[i]=-1; dis[q[r++]=scr]=0; for(l=0; l<r; ++l) { for(i=head[u=q[l]];i>=0;i=next[i]) { if(flow[i]&&dis[v=ver[i]]<0) { dis[q[r++]=v]=dis[u]+1; if(v==dest) return 1; } } } return 0;}int Dinic_dfs(int u,int exp){ if(u==dest) return exp; for(int &i=work[u],v,tmp;i>=0;i=next[i]) if(flow[i]&&dis[v=ver[i]]==dis[u]+1&&(tmp=Dinic_dfs(v,min(exp,flow[i])))>0) { flow[i]-=tmp; flow[i^1]+=tmp; return tmp; } return 0;}int Dinic_flow(){ int i,ret=0,delta; while(Dinic_bfs()) { for(i=0;i<node;++i) work[i]=head[i]; while(delta=Dinic_dfs(scr,oo)) ret+=delta; } return ret;}int main(){ int a,b,c,d; int u,v,z; char hehe; while(cin>>a>>b>>c>>d) { prepare(a+3,0,a+1); for(int i=0;i<d;i++) { while(getchar()!='('); scanf("%d,%d)%d",&u,&v,&z); addedge(u+1,v+1,z); } for(int i=0;i<b;i++) { while(getchar()!='('); scanf("%d)%d",&u,&z); addedge(0,u+1,z); } for(int i=0;i<c;i++) { while(getchar()!='('); scanf("%d)%d",&u,&z); addedge(u+1,a+1,z); } cout<<Dinic_flow()<<endl; } return 0;}
0 0
- poj 1459
- 1459 poj
- POJ 1459
- POJ 1459
- poj 1459
- POJ 1459
- poj 1459
- POJ 1459 Power Network
- POJ 1459 Power Network
- poj 1459(最大流)
- Poj 1459 Power Network
- poj 1459 Power Network
- poj 1459 Power Network
- POJ 1459 Power Network
- POJ 1459 Power Network
- POJ 1459 最大流
- POJ-1459-Power Network
- Poj 1459 Power Network
- See LCS again 最长递增子序列到最长公共子序列的转化
- poj 1273
- 到csnd的第一篇博客,记录一个菜鸟程序员的成长历程。
- java I/O
- Hbuilder开发app实战-识岁04-七牛云上传文件的js实现
- poj 1459
- 黑客注入之手工注入
- 例题9-11 最大面积的最小的三角剖分 UVa1331
- 数据结构之---C语言实现关键路径AOE图
- 树的共同祖先
- 5种创建UIImage的类方法
- Java开发中的23种设计模式详解(转)
- C++用多种方式实现Singleton单例模式
- atitit.javascript js 上传文件的本地预览