#include<cstdio>
#include<algorithm>
#include<iostream>
#include<cmath>
#include<climits>
#include<cstring>
#include<queue>
#include<vector>
#include<map>
#include<set>
using namespace std;
int cap[110][110];
int flow[110][110];
int a[110];
int n,m,np,nc;
int maxs,maxt;
int EK(int s,int t)
{
queue<int> q;
memset(flow,0,sizeof(flow));
int f=0;
int p[110];
for(;;)
{
memset(a,0,sizeof(a));
a[s]=maxs;
q.push(s);
while(!q.empty())
{
int u=q.front();
q.pop();
for(int v=0;v<=n+1;v++)if(!a[v]&&cap[u][v]>flow[u][v])
{
p[v]=u;
q.push(v);
a[v]=min(a[u],cap[u][v]-flow[u][v]);
}
}
if(a[t]==0)break;
for(int u=t;u!=s;u=p[u])
{
flow[p[u]][u]+=a[t];
flow[u][p[u]]-=a[t];
}
f+=a[t];
}
return f;
}
int main()
{
while(~scanf("%d%d%d%d",&n,&np,&nc,&m))
{
maxs=0;
maxt=0;
memset(cap,0,sizeof(cap));
int s=n,t=n+1;
char ss[20];
for(int i=0;i<m;i++)
{
scanf("%s",ss);
int u,v,l;
sscanf(ss,"(%d,%d)%d",&u,&v,&l);
cap[u][v]+=l;
}
for(int i=0;i<np;i++)
{
scanf("%s",ss);
int p,u;
sscanf(ss,"(%d)%d",&u,&p);
cap[n][u]+=p;
maxs+=p;
}
for(int i=0;i<nc;i++)
{
scanf("%s",ss);
int c,u;
sscanf(ss,"(%d)%d",&u,&c);
cap[u][n+1]+=c;
maxt+=c;
}
//printf("%d\n",maxt);
int res=min(maxt,EK(s,t));
printf("%d\n",res);
}
return 0;
}
POJ 1459 Power Network (最大流+多源多汇问题+入门题)
最新推荐文章于 2024-09-19 16:46:51 发布