poj_1459

源链接：http://poj.org/problem?id=1459
题目大意：一共有n个点，np个发电站，nc个消耗站，m条线路，问从发电站发电，最多能送达的电量是多少？
明显是一个最大流的问题，我们建一个超级源点，与np个发电站相连，容量为发电站的发电量，然后再将m条线路相连，容量为其能传输的最大容量，最后将nc个消耗站与超级终端相连，容量为其能接受的容量。建好图后求一次最大流就好。

在这里我们采用Dinic算法来求。

#include<stdio.h>
#include<iostream>
#include<string>
#include<string.h>
#include<algorithm>
#include<iomanip>
#include<vector>
#include<time.h>
#include<queue>
#include<stack>
#include<iterator>
#include<math.h>
#include<stdlib.h>
#include<limits.h>
#include<map>
//#define ONLINE_JUDGE
#define eps 1e-8
#define INF 0x7fffffff
#define FOR(i,a) for((i)=0;i<(a);(i)++)
#define MEM(a) (memset((a),0,sizeof(a)))
#define sfs(a) scanf("%s",a)
#define sf(a) scanf("%d",&a)
#define sfI(a) scanf("%I64d",&a)
#define pf(a) printf("%d\n",a)
#define pfI(a) printf("%I64d\n",a)
#define pfs(a) printf("%s\n",a)
#define sfd(a,b) scanf("%d%d",&a,&b)
#define sft(a,b,c)scanf("%d%d%d",&a,&b,&c)
#define for1(i,a,b) for(int i=(a);i<b;i++)
#define for2(i,a,b) for(int i=(a);i<=b;i++)
#define for3(i,a,b)for(int i=(b);i>=a;i--)
#define MEM1(a) memset(a,0,sizeof(a))
#define MEM2(a) memset(a,-1,sizeof(a))
const double PI=acos(-1.0);
template<class T> T gcd(T a,T b){return b?gcd(b,a%b):a;}
template<class T> T lcm(T a,T b){return a/gcd(a,b)*b;}
template<class T> inline T Min(T a,T b){return a<b?a:b;}
template<class T> inline T Max(T a,T b){return a>b?a:b;}
using namespace std;
#define ll __int64
int n,m;
#define Mod 1000000007
#define N 110
#define M 1000010
struct Edge{
	int from,to,cap,flow;
};
struct Dinic{							//Dinic求最大流
	int n,m,s,t;
	vector<Edge> edges;
	vector<int> G[N];
	bool vis[N];
	int d[N];
	int cur[N];
	void Init(int n,int m,int s,int t){
		this->n = n;
		this->m = m;
		this->s = s;
		this->t = t;
		edges.clear();
		for(int i=0;i<N;i++)
			G[i].clear();
	}
	void addEdge(int u,int v,int cap){
		edges.push_back((Edge){u,v,cap,0});
		edges.push_back((Edge){v,u,0,0});
		m = edges.size();
		G[u].push_back(m-2);
		G[v].push_back(m-1);
	}
	bool BFS(){							//分层
		memset(vis,0,sizeof vis);
		queue<int> q;
		q.push(s);
		d[s] = 0;
		vis[s] = 1;
		while(!q.empty()){
			int x = q.front();
			q.pop();
			for(int i=0;i<(int)G[x].size();i++){
				Edge &e = edges[G[x][i]];
				if(!vis[e.to] && e.cap>e.flow){
					vis[e.to] = 1;
					d[e.to] = d[x] + 1;
					q.push(e.to);
				}
			}
		}
	return vis[t];
	}
	int DFS(int x,int a){
		if(x == t || a == 0) return a;
		int flow = 0, f;
		for(int &i=cur[x];i<(int)G[x].size();i++){
			Edge &e = edges[G[x][i]];
			if(d[x]+1==d[e.to] && (f=DFS(e.to,Min(a,e.cap-e.flow)))>0){
				e.flow += f;
				edges[G[x][i]^1].flow -= f;
				flow += f;
				a -= f;
				if(a==0) break;
			}
		}
		return flow;
	}
	int MaxFlow(){
		int flow = 0;
		while(BFS()){
			memset(cur,0,sizeof cur);
			flow += DFS(s,INF);
		}
		return flow;
	}
}gao;
int main(){
#ifndef ONLINE_JUDGE
    freopen("in.txt","r",stdin);
//  freopen("out.txt","w",stdout);
#endif
    	int np,nc;
    	while(scanf("%d%d%d%d",&n,&np,&nc,&m)!=EOF){
    		int src = 0;										//源点
    		int des = n+1;				//汇点
    		gao.Init(n,m,src,des);
    		char tmp[25];
    		int u,v,w;
    		while(m--){
    			sfs(tmp);
    			sscanf(tmp,"(%d,%d)%d",&u,&v,&w);	//因为编号是从0开始的，而0又要作为源点的编号，所以将每个点+1
    			gao.addEdge(u+1,v+1,w);
    		}
    		while(np--){
    			sfs(tmp);
    			sscanf(tmp,"(%d)%d",&v,&w);
    			gao.addEdge(src,v+1,w);
    		}
    		while(nc--){
    			sfs(tmp);
    			sscanf(tmp,"(%d)%d",&u,&w);
    			gao.addEdge(u+1,des,w);
    		}
    		printf("%d\n",gao.MaxFlow());
    	}
return 0;
}