Dinic之当前弧优化 POJ1459

#include <stdio.h>
#include <iostream>
#include <algorithm>
#include <string.h>
#include <queue>

using namespace std;
#define ll long long
#define mem(a, b) memset(a,b,sizeof(a))
#define INF 0x3f3f3f3f
#define DBG printf("this is a input\n")
#define first fi
#define second se
#define mk(a, b) make_pair(a,b)
int head[105], cnt, level[105], cur[105];
struct e
{
    int next;
    int to;
    int c;
}edge[105*105*2];
void add(int f, int t, int c)
{
    edge[cnt].to = t;
    edge[cnt].c = c;
    edge[cnt].next = head[f];
    head[f] = cnt ++;
}
int n , np , nc ,m, st, ed;
bool dinicBfs(int s, int e)
{
    mem(level,0);
    queue<int>q;
    level[s] = 1;
    q.push(s);
    while(!q.empty())
    {
        int root = q.front();
        q.pop();
        for(int i = head[root] ; i != -1 ; i = edge[i].next)
        {
            int v = edge[i].to;
            int c = edge[i].c;
            if(!level[v] && c > 0)
            {
                level[v] = level[root] + 1;
                q.push(v);
            }
        }
    }
    return level[e] != 0;
}
int dinicDfs(int root ,int flow)
{
    if(root == ed)
        return flow;
    int newflow;
    for(int& i = cur[root] ; i != -1 ; i = edge[i].next)
    {
        int c = edge[i].c , v = edge[i].to;
        if(c > 0 && level[v] == level[root]+1 && (newflow = dinicDfs(v,min(c,flow))))
        {
            edge[i].c -= newflow;
            edge[i^1].c += newflow;
            return newflow;
        }
    }
    return 0;
}
int dinic()
{
    int ans = 0, crease;
    while(dinicBfs(st,ed))
    {
        for(int i = 0 ; i <= n+1 ; i ++)
            cur[i] = head[i];
        while(crease = dinicDfs(st,INF))
            ans += crease;
    }
    return ans;
}
int main(void)
{
    while(scanf("%d %d %d %d",&n,&np,&nc,&m) != EOF)
    {
        mem(head,-1);
        st = cnt = 0 , ed = n+1;
        for(int i = 1 ; i <= m ; i ++)
        {
            int u ,v , c;
            scanf(" (%d,%d)%d",&u,&v,&c);
            add(u+1,v+1,c);
            add(v+1,u+1,0);
        }
        for(int i = 1 ; i <= np ; i ++)
        {
            int v , c;
            scanf(" (%d)%d",&v,&c);
            add(st,v+1,c);
            add(v+1,st,0);
        }
        for(int i = 1 ; i <= nc ; i ++)
        {
            int v , c;
            scanf(" (%d)%d",&v,&c);
            add(v+1,ed,c);
            add(ed,v+1,0);
        }
        int ans = dinic();
        printf("%d\n",ans);
    }
}