【POJ1459】【最大流】【EK】
2015-09-09 10:22
253 查看
Power Network
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.
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
Sample Output
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
Time Limit: 2000MS | Memory Limit: 32768K | |
Total Submissions: 25417 | Accepted: 13249 |
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.
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)20 7 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
15 6
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
#include <iostream> #include <cstring> #include <cmath> #include <queue> #include <stack> #include <list> #include <map> #include <set> #include <string> #include <cstdlib> #include <cstdio> #include <algorithm> using namespace std; int n,np,nc,m; const int maxv = 110; int c[maxv][maxv]; int f[maxv][maxv]; int pre[maxv]; int a[maxv]; const int INF = 0x3f3f3f3f; int EK(int s,int t) { queue<int> q; int ans = 0; while(true) { memset(a,0,sizeof(a)); a[s] = INF; q.push(s); while(!q.empty()) { int u = q.front(); q.pop(); for(int v=0;v<=t;v++) { if(!a[v] && c[u][v] > f[u][v]) { a[v] = min(a[u],c[u][v]-f[u][v]); pre[v] = u; q.push(v); } } } if(a[t] == 0) break; for(int u=t;u!=s;u=pre[u]) { f[pre[u]][u] += a[t]; f[u][pre[u]] -= a[t]; } ans += a[t]; } return ans; } int main() { while(scanf("%d%d%d%d",&n,&np,&nc,&m) != EOF) { memset(c,0,sizeof(c)); memset(f,0,sizeof(f)); for(int i=0;i<m;i++) { int u,v,w; scanf(" (%d,%d)%d",&u,&v,&w); c[u+1][v+1] += w; } for(int i=0;i<np;i++) { int u,w; scanf(" (%d)%d",&u,&w); c[0][u+1] += w; } for(int i=0;i<nc;i++) { int u,w; scanf(" (%d)%d",&u,&w); c[u+1][n+1] += w; } printf("%d\n",EK(0,n+1)); } return 0; }
相关文章推荐
- Java 正则表达式
- linux重启oracle 各种方法
- ios获取iphone手机设备型号
- 最小的K个数
- 解决pycharm无法提示pyqt4.QtGui但是可以运行的问题
- phpcms v9 邀请用户注册自动获取积分奖励
- Oracle中restore与recover区别
- laravel file_put_contents 报错
- 我的layerfsd已经开源
- 高性能网络编程7--tcp连接的内存使用
- 关于easyui的datagrid detailview的初次点击出现的重叠错位问题
- 关于用户身份及密码问题的说明
- Mblog 部署手册
- 15个问答为专业测试人员揭开“精准测试”的面纱
- Android GsonUtils工具类
- hadoop 输出文件 key val 分隔符
- 修改sharepoint列表样式
- jquery.cookie.js 使用
- ORACLE中的FTP例子代码
- Cas单点登录 证书问题