HDU-4292 Food

这道题和之前那题思路一样：POJ-3281 Dining

写了ISAP+bfs+栈优化练练手

#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cmath>
#include<map>
using namespace std;
typedef long long ll;
const int N=1000+10;
const int M=2e5+10;
const int INF=0x7f7f7f7f;
struct Edge
{
    int to,nxt,cap,flow;
}edge[M];
int tot,first[N];
void addedge(int u,int v,int w,int rw=0)
{
    edge[tot].to=v;edge[tot].cap=w;edge[tot].flow=0;
    edge[tot].nxt=first[u];first[u]=tot++;
    edge[tot].to=u;edge[tot].cap=rw;edge[tot].flow=0;
    edge[tot].nxt=first[v];first[v]=tot++;
}
void init()
{
    tot=0;
    memset(first,-1,sizeof(first));
}

int gap[N],dep[N],cur[N];
int Q[N],S[N];
void bfs(int s)
{
    memset(dep,-1,sizeof(dep));
    memset(gap,0,sizeof(gap));
    int q0=0,q1=0;
    Q[q1++]=s;
    dep[s]=0;
    gap[0]=1;
    while(q0<q1)
    {
        int u=Q[q0++];
        for(int i=first[u];i!=-1;i=edge[i].nxt)
        {
            int v=edge[i].to;
            if(dep[v]!=-1) continue;
            dep[v]=dep[u]+1;
            gap[dep[v]]++;
            Q[q1++]=v;
        }
    }
}
int sap(int s,int t,int n)
{
    int ans=0;
    bfs(t);
    memcpy(cur,first,sizeof(first));
    int u=s;
    int top=0;
    while(dep[s]<n)
    {
        if(u==t)
        {
            int Min=INF;
            int inser;
            for(int i=0;i<top;i++)
                if(Min>edge[S[i]].cap-edge[S[i]].flow)
                {
                    Min=edge[S[i]].cap-edge[S[i]].flow;
                    inser=i;
                }
            for(int i=0;i<top;i++)
            {
                edge[S[i]].flow+=Min;
                edge[S[i]^1].flow-=Min;
            }
            ans+=Min;
            top=inser;
            u=edge[S[top]^1].to;
        }
        bool flag=false;
        int v;
        for(int i=cur[u];i!=-1;i=edge[i].nxt)
        {
            v=edge[i].to;
            if(edge[i].cap-edge[i].flow&&dep[v]+1==dep[u])
            {
                flag=true;
                cur[u]=S[top++]=i;
                break;
            }
        }
        if(flag)
        {
            u=v;
            continue;
        }
        gap[dep[u]]--;
        if(!gap[dep[u]]) return ans;
        int Min=n;
        for(int i=first[u];i!=-1;i=edge[i].nxt)
            if(edge[i].cap-edge[i].flow&&Min>dep[edge[i].to])
            {
                Min=dep[edge[i].to];
                cur[u]=i;
            }
        dep[u]=Min+1;
        gap[dep[u]]++;
        if(u!=s) u=edge[S[--top]^1].to;
    }
    return ans;
}
char str[N];
int main()
{
    int n,f,d;
    while(~scanf("%d%d%d",&n,&f,&d))
    {
        init();
        int s=0,t=2*n+f+d+1;
        int a;
        for(int i=1;i<=f;i++)
        {
            scanf("%d",&a);
            addedge(0,2*n+i,a);
        }
        for(int i=1;i<=d;i++)
        {
            scanf("%d",&a);
            addedge(2*n+f+i,t,a);
        }
        for(int i=1;i<=2*n;i+=2)
        {
            addedge(i,i+1,1);
            scanf("%s",str);
            for(int j=0;j<f;j++)
                if(str[j]=='Y')
                    addedge(2*n+j+1,i,INF);
        }
        for(int i=1;i<=2*n;i+=2)
        {
            scanf("%s",str);
            for(int j=0;j<d;j++)
                if(str[j]=='Y')
                    addedge(i+1,2*n+f+j+1,INF);
        }
        printf("%d\n",sap(s,t,t+1));
    }
    return 0;
}