hdoj 4292 Food 【拆点 网络流】

4 3 3
1 1 1
1 1 1
YYN
NYY
YNY
YNY
YNY
YYN
YYN
NNY

3

#include <cstdio>
#include <cstring>
#include <algorithm>
#include <queue>
#define MAXN 1000
#define MAXM 200000+10
#define INF 0x3f3f3f3f
using namespace std;
struct Edge
{
    int from, to, cap, flow, next;
};
Edge edge[MAXM];
int head[MAXN], edgenum;
int dist[MAXN], cur[MAXN];
bool vis[MAXN];
int N, F, D;
int source, sink;//超级源点 超级汇点
void init()
{
    edgenum = 0;
    memset(head, -1, sizeof(head));
}
void addEdge(int u, int v, int w)
{
    Edge E1 = {u, v, w, 0, head[u]};
    edge[edgenum] = E1;
    head[u] = edgenum++;
    Edge E2 = {v, u, 0, 0, head[v]};
    edge[edgenum] = E2;
    head[v] = edgenum++;
}
void getMap()
{
    int a;
    source = 0, sink = 2*N + F + D + 1;
    //人拆点后 编号从1到2*N
    for(int i = 1; i <= N; i++)//对人拆点
        addEdge(i, i+N, 1);//只能选一种食物和一种饮料
    //食物编号从2*N+1到2*N+F
    for(int i = 1; i <= F; i++)
    {
        scanf("%d", &a);
        addEdge(source, 2*N+i, a);//源点 到 食物建边
    }
    //饮料编号2*N+F+1到2*N+F+D
    for(int i = 1; i <= D; i++)
    {
        scanf("%d", &a);
        addEdge(2*N+F+i, sink, a);//饮料 到 汇点建边
    }
    char str[300];
    for(int i = 1; i <= N; i++)
    {
        scanf("%s", str);
        for(int j = 0; j < F; j++)
        {
            if(str[j] == 'Y')//第i个人 接受 第j+1种食物
                addEdge(2*N+j+1, i, 1);
        }
    }
    for(int i = 1; i <= N; i++)
    {
        scanf("%s", str);
        for(int j = 0; j < D; j++)
        {
            if(str[j] == 'Y')//第i个人 接受 第j+1种饮料
                addEdge(i+N, 2*N+F+j+1, 1);
        }
    }
}
bool BFS(int s, int t)
{
    queue<int> Q;
    memset(dist, -1, sizeof(dist));
    memset(vis, false, sizeof(vis));
    dist[s] = 0;
    vis[s] = true;
    Q.push(s);
    while(!Q.empty())
    {
        int u = Q.front();
        Q.pop();
        for(int i = head[u]; i != -1; i = edge[i].next)
        {
            Edge E = edge[i];
            if(!vis[E.to] && E.cap > E.flow)
            {
                dist[E.to] = dist[u] + 1;
                if(E.to == t) return true;
                vis[E.to] = true;
                Q.push(E.to);
            }
        }
    }
    return false;
}
int DFS(int x, int a, int t)
{
    if(x == t || a == 0) return a;
    int flow = 0, f;
    for(int &i = cur[x]; i != -1; i = edge[i].next)
    {
        Edge &E = edge[i];
        if(dist[E.to] == dist[x] + 1 && (f = DFS(E.to, min(a, E.cap - E.flow), t)) > 0)
        {
            edge[i].flow += f;
            edge[i^1].flow -= f;
            flow += f;
            a -= f;
            if(a == 0) break;
        }
    }
    return flow;
}
int Maxflow(int s, int t)
{
    int flow = 0;
    while(BFS(s, t))
    {
        memcpy(cur, head, sizeof(head));
        flow += DFS(s, INF, t);
    }
    return flow;
}
int main()
{
    while(scanf("%d%d%d", &N, &F, &D) != EOF)
    {
        init();
        getMap();
        printf("%d\n", Maxflow(source, sink));
    }
    return 0;
}