POJ 1459

#include <iostream>
#include <stdio.h>
#include <string.h>
#include <string>
#include <queue>
using namespace std;
const int MAXSIZE = 102;
const int INF = 0x3f3f3f3f;
int nnode;
int nprodece;
int nconsume;
int road[MAXSIZE][MAXSIZE];
int visit[MAXSIZE];
int pre[MAXSIZE];
int m;
int start, end;
queue<int> Q;

// 增加一个超级源点，一个超级汇点
// consume节点到超级汇点的边为最大消耗的值
// produce节点到超级源点的边为最大生产的值
// nnode为超级源点， nnode+1为超级汇点
// 采用EK算法
bool getpath(int s, int e){
    memset(visit, 0, sizeof(visit));
    memset(pre, -1, sizeof(pre));
    while (!Q.empty()) Q.pop();

    Q.push(s);
    visit[s] = 1;
    while (!Q.empty()){
        int temp = Q.front();
        Q.pop();
        if (temp == e)
            return true;
        // 从与它相连接的节点找出一个
        for (int i = 0; i <=e; ++i) {
            if (road[temp][i]&&!visit[i]){
                pre[i] = temp;
                visit[i] = true;
                Q.push(i);
            }
        }
    }
    return false;
}

int getmaxflow(int s, int e){
    int res = 0;
    // 寻找增广路径
    while (getpath(s, e)){
        // 说明找到了一条路径
        int t = e;
        int cur = INF;
        while (pre[t] != -1){
            cur = min(cur, road[pre[t]][t]);
            t = pre[t];
        }
        // 将这条路径上的值进行更新
        t = e;
        while (pre[t] != -1){
            road[pre[t]][t] -= cur;
            road[t][pre[t]] += cur;
            t = pre[t];
        }
        // 更新完毕
        res += cur;
    }
    return res;
}

int main(){
//    freopen("../in.txt", "r", stdin);
    while (cin>>nnode>>nprodece>>nconsume>>m){
        memset(road, 0, sizeof(road));
        char temp;
        start = nnode;
        end = nnode+1;
        int x, y, val;
        for (int i = 0; i < m; ++i) {
            cin>>temp>>x>>temp>>y>>temp>>val;
            if (x == y) continue;
            road[x][y] = val;
        }
        // 生产节点
        for (int i = 0; i < nprodece; ++i) {
            cin>>temp>>x>>temp>>val;
            road[start][x] = val;
        }
        for (int i = 0; i < nconsume; ++i) {
            cin>>temp>>x>>temp>>val;
            road[x][end] = val;
        }
        // 图建立完成,转化为求从nnode到nnode+1的最大流问题
        cout<<getmaxflow(start, end)<<endl;
    }
}