poj1459Power Network
来源:互联网 发布:mac 安装win分区 编辑:程序博客网 时间:2024/05/21 09:19
Time Limit: 2000MS Memory Limit: 32768KTotal Submissions: 24159 Accepted: 12596
Description
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.
Source
Southeastern Europe 2003
题意:
给几个发电站,给几个消耗站,再给几个转发点。
发电站只发电,消耗站只消耗电,发电站跟发电站,发电站跟消耗站可以连线,再给各个传送线的传电能力。
问你消耗站能获得的最多电是多少。
增加一个超级源点,和超级汇点。。把所给的发电站都和超级源点相连,把所给的消耗战都和超级汇点相连
Dinic
题意:
给几个发电站,给几个消耗站,再给几个转发点。
发电站只发电,消耗站只消耗电,发电站跟发电站,发电站跟消耗站可以连线,再给各个传送线的传电能力。
问你消耗站能获得的最多电是多少。
增加一个超级源点,和超级汇点。。把所给的发电站都和超级源点相连,把所给的消耗战都和超级汇点相连
Dinic
#include<map>#include<string>#include<cstring>#include<cstdio>#include<cstdlib>#include<cmath>#include<queue>#include<vector>#include<iostream>#include<algorithm>#include<bitset>#include<climits>#include<list>#include<iomanip>#include<stack>#include<set>using namespace std;int head[210],tail;struct Edge{int from,to,cap,flow,next;}edge[40010];void add(int from,int to,int cap,int flow){edge[tail].to=to;edge[tail].cap=cap;edge[tail].flow=flow;edge[tail].next=head[from];head[from]=tail++;}int dis[210],ed;bool vis[210];bool bfs(){memset(vis,0,sizeof(vis));queue<int>qq;qq.push(0);dis[0]=0;vis[0]=1;while(qq.size()){int from=qq.front();qq.pop();for(int i=head[from];i!=-1;i=edge[i].next){int to=edge[i].to;if(!vis[to]&&edge[i].cap>edge[i].flow){vis[to]=1;dis[to]=dis[from]+1;qq.push(to);}}}return vis[ed];}int cur[210];int dfs(int from,int mn){if(from==ed||mn==0)return mn;int ans=0,f;for(int &i=cur[from];i!=-1;i=edge[i].next){int to=edge[i].to,cap=edge[i].cap,flow=edge[i].flow;if(dis[from]+1==dis[to]&&(f=dfs(to,min(mn,cap-flow)))>0){edge[i].flow+=f;edge[i^1].flow-=f;ans+=f;mn-=f;if(mn==0)break;}}return ans;}int maxflow(){int ans=0;do{for(int i=0;i<=ed;i++)cur[i]=head[i];ans+=dfs(0,INT_MAX);}while(bfs());return ans;}char s[100];int main(){int n,np,nc,m;while(scanf("%d%d%d%d",&n,&np,&nc,&m)!=EOF){tail=0;memset(head,-1,sizeof(head));while(m--){int from,to,v;scanf("%s",s);sscanf(s,"(%d,%d)%d",&from,&to,&v);add(from+1,to+1,v,0);add(to+1,from+1,0,0);}while(np--){int x,v;scanf("%s",s);sscanf(s,"(%d)%d",&x,&v);scanf("(%d)%d",&x,&v);add(0,x+1,v,0);add(x+1,0,0,0);}ed=n+1;while(nc--){int x,v;scanf("%s",s);sscanf(s,"(%d)%d",&x,&v);scanf("(%d)%d",&x,&v);add(x+1,ed,v,0);add(ed,x+1,0,0);}printf("%d\n",maxflow());}}
0 0
- poj1459Power Network
- poj1459Power Network(最大流)
- POJ1459Power Network(电网)
- POJ1459Power Network(电网)
- POJ1459Power Network(最大流)
- POJ1459Power Network(电网)——最大流水题
- [network]
- NETWORK
- Network
- network
- network
- Network
- NETWORK
- network
- Network
- network
- Network
- Network
- ORA-01090: shutdown in progress - connection is not permitted
- 0、Windows基础
- Android动画坐标图解
- java.lang.ClassCastException: android.widget.RelativeLayout$LayoutParams cannot be cast to android.w
- jQuery 过滤选择器的使用
- poj1459Power Network
- Aizu 1263 Network Mess 树的直径+构造
- 磁共振T1 T2 T1WI T2WI含义
- 跨领域的智能云管理平台-孙立辉(云平台 CSM)
- 设置初始归档模式
- 浅谈跨域以WebService对跨域的支持
- Linux shell 中判断一个变量是否为空 的方法
- js判断ie浏览器版本
- storybord使用方法