题意:有三种节点:发电站,消费者,转换器。每种节点都可能多于一个。发电站只发电,有最大发电量;消费者只费电,有最大消耗量;转换器接收到多少电就放出多少电。每条线路上也有流量限制。求所有消费者能消费的最大电量。
思路:多源多汇的最大流。添加超级源点和超级汇点即可。
#include <stdio.h>
#include <string.h>
#define min(a,b) a<b?a:b
#define N 105
int c[N][N],a[N],pre[N],q[N];
int n,m,x,y;
int maxflow(int s,int t){
int i,front,rear,now,res = 0;
while(1){
front = rear = -1;
memset(a,0,sizeof(a));
memset(pre,0,sizeof(pre));
a[s] = 0x3fffffff;
q[++rear] = s;
while(front < rear){
now = q[++front];
for(i = 0;i<=t;i++)
if(!a[i] && c[now][i]>0){
a[i] = min(a[now],c[now][i]);
pre[i] = now;
q[++rear] = i;
}
}
if(!a[t])
break;
res += a[t];
for(i = t;i!=s;i=pre[i]){
c[pre[i]][i] -= a[t];
c[i][pre[i]] += a[t];
}
}
return res;
}
int main(){
freopen("a.txt","r",stdin);
while(scanf("%d %d %d %d",&n,&x,&y,&m)!=EOF){
int i,j,k,w,source,sink;
char ch;
memset(c,0,sizeof(c));
while(m--){
while((ch=getchar()) && isspace(ch));
scanf("%d,%d)%d",&i,&j,&w);
c[i][j] = w;
}
source = n;
sink = n+1;
for(k = 0;k<x;k++){
while((ch=getchar()) && isspace(ch));
scanf("%d)%d",&i,&w);
c[source][i] = w;
}
for(k = 0;k<y;k++){
while((ch=getchar()) && isspace(ch));
scanf("%d)%d",&i,&w);
c[i][sink] = w;
}
printf("%d\n",maxflow(source,sink));
}
return 0;
}