hdu4322 Candy 费用流

//#include<iostream>
#include<cstdio>
#include<string>
#include<cstring>
#include<algorithm>
#include<cmath>
#include<queue>
using namespace std;
const int inf=0x3fffffff;
const int maxn=105;
struct edge
{
    int to,c,d,next;
}ee[maxn*maxn];
int e[maxn],ecnt;
int like[maxn][maxn],b[maxn],n,m,k;
deque<int> dq;
bool inq[maxn];
int dis[maxn],back[maxn];
int mf,mc,st,ed;
void addedge(int u,int v,int c,int d)
{
    ee[ecnt].to=v;ee[ecnt].c=c;ee[ecnt].d=d;ee[ecnt].next=e[u];e[u]=ecnt++;
    ee[ecnt].to=u;ee[ecnt].c=0;ee[ecnt].d=-d;ee[ecnt].next=e[v];e[v]=ecnt++;
}
void build()
{
    int i,j;
    ecnt=0;memset(e,-1,sizeof(e));
    st=0;ed=n+m+1;
    for(i=1;i<=n;++i)
    {
        addedge(0,i,1,0);
    }
    for(i=1;i<=m;++i)
    {
        for(j=1;j<=n;++j)
        {
            if(like[i][j])
            {
                addedge(j,n+i,1,0);
            }
        }
        addedge(n+i,ed,b[i]/k,k);
        if(b[i]%k>1)
            addedge(n+i,ed,1,b[i]%k);
    }
}
bool spfa()
{
    while(!dq.empty())
        dq.pop_front();
    memset(inq,false,sizeof(inq));
    memset(dis,-1,sizeof(dis));
    memset(back,-1,sizeof(back));
    int i,j,u,v,w;
    dis[st]=0;inq[st]=true;dq.push_front(st);
    while(!dq.empty())
    {
        u=dq.front();dq.pop_front();inq[u]=false;
        for(i=e[u];i!=-1;i=ee[i].next)
        {
            if(ee[i].c<=0)
                continue;
            v=ee[i].to;w=ee[i].d;
            if(dis[v]<dis[u]+w)
            {
                dis[v]=dis[u]+w;back[v]=i;
                if(!inq[v])
                {
                    if(!dq.empty()&&dis[v]>=dis[dq.front()])
                    {
                        dq.push_front(v);inq[v]=true;
                    }
                    else
                    {
                        dq.push_back(v);inq[v]=true;
                    }
                }
            }
        }
    }
    return dis[ed]!=-1;
}
int aug()
{
    int flow,i,j;
    flow=inf;i=ed;
    while(back[i]!=-1)
    {
        flow=min(flow,ee[back[i]].c);
        i=ee[back[i]^1].to;
    }
    i=ed;
    while(back[i]!=-1)
    {
        ee[back[i]].c-=flow;
        ee[back[i]^1].c+=flow;
        i=ee[back[i]^1].to;
    }
    return flow;
}
void mfmc()
{
    mf=0;mc=0;
    int a;
    while(spfa())
    {
        mc+=dis[ed];
        mf+=aug();
    }
}
bool judge()
{
    mfmc();
    int i,tmp=0;
    for(i=1;i<=m;++i)
        tmp+=b[i];
    tmp-=mc;
    return n-mf>=tmp;
}
int main()
{
    int i,j,t,cas=0;
    scanf("%d",&t);
    while(t--)
    {
        scanf("%d%d%d",&n,&m,&k);
        for(i=1;i<=m;++i)
            scanf("%d",&b[i]);
        for(i=1;i<=m;++i)
            for(j=1;j<=n;++j)
                scanf("%d",&like[i][j]);
        build();
        if(judge())
        {
            printf("Case #%d: YES\n",++cas);
        }
        else
        {
            printf("Case #%d: NO\n",++cas);
        }
    }
    return 0;
}