这道题目描述了很多,其实就是每条边有一个输送容量,每个consumer有一个最大消耗值,station有一个最大生产值。求最大的消耗量。
将station与源点相连,弧的容量为最大生产值。将consumer与汇点相连,弧的容量为最大消耗值,在更具题目中所给的边的信息将各节点相连。
Power Network
Time Limit: 2000MS | Memory Limit: 32768K | |
Total Submissions: 18221 | Accepted: 9596 |
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) <= p
max(u) of power, may consume an amount 0 <= c(u) <= min(s(u),c
max(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) <= l
max(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 p max(u)=y. The label x/y of consumer u shows that c(u)=x and c max(u)=y. The label x/y of power transport line (u,v) shows that l(u,v)=x and l max(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.
![](https://i-blog.csdnimg.cn/blog_migrate/1c1354d5a7c820146d570a7875b230b3.jpeg)
An example is in figure 1. The label x/y of power station u shows that p(u)=x and p max(u)=y. The label x/y of consumer u shows that c(u)=x and c max(u)=y. The label x/y of power transport line (u,v) shows that l(u,v)=x and l max(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 l
max(u,v). Follow np doublets (u)z, where u is the identifier of a power station and 0 <= z <= 10000 is the value of p
max(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 c
max(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.
#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cstring>
#include<string>
using namespace std;
#define MAXN 110
#define INF 0xFFFFFF
#define mm(a) memset((a),0,sizeof((a)))
int n,np,nc,m,c[MAXN][MAXN],dis[MAXN],gap[MAXN],st,ed;
int sap(int u,int flow)
{
if(u==ed)
return flow;
int ans=0,i,t;
for(i=0;i<=n+1;++i)
if(c[u][i]&&dis[u]==dis[i]+1)
{
t=sap(i,min(flow-ans,c[u][i]));
c[u][i]-=t,c[i][u]+=t,ans+=t;
if(ans==flow)
return ans;
}
if(dis[st]>=n+2)
return ans;
if(!--gap[dis[u]])
dis[st]=n+2;
++gap[++dis[u]];
return ans;
}
void init()
{
int a,b,c_;
mm(c),mm(dis),mm(gap);
for(int i=1;i<=m;i++)
{
scanf(" (%d,%d)%d",&a,&b,&c_);
c[a+1][b+1]+=c_;
}
for(int i=1;i<=np;i++)
{
scanf(" (%d)%d",&a,&b);
c[0][a+1]+=b;
}
for(int i=1;i<=nc;i++)
{
scanf(" (%d)%d",&a,&b);
c[a+1][n+1]+=b;
}
st=0,ed=n+1;
}
int main()
{
while(scanf("%d%d%d%d",&n,&np,&nc,&m)!=EOF)
{
int ans=0;
init();
for(gap[0]=n+2;dis[st]<n+2;)
ans+=sap(st,INF);
printf("%d\n",ans);
}
return 0;
}