HDU 2732 Leapin' Lizards

网络最大流+拆点。输出有坑！！！

#include<cstdio>
#include<cstring>
#include<string>
#include<cmath>
#include<vector>
#include<queue>
#include<algorithm>
using namespace std;

const int maxn=+;
const int INF=0x7FFFFFFF;

struct Edge
{
    int from,to,cap,flow;
};
vector<Edge>edges;
vector<int>G[maxn];
bool vis[maxn];
int d[maxn];
int cur[maxn];
int n,m,s,t;

//求出层次网络
bool BFS()
{
    memset(vis,,sizeof(vis));
    queue<int>Q;
    Q.push(s);
    d[s]=;
    vis[s]=;
    while(!Q.empty())
    {
        int x=Q.front();
        Q.pop();
        for(int i=; i<G[x].size(); i++)
        {
            Edge& e=edges[G[x][i]];
            if(!vis[e.to]&&e.cap>e.flow)
            {
                vis[e.to]=;
                d[e.to]=d[x]+;
                Q.push(e.to);
            }
        }
    }
    return vis[t];
}

//加边
void AddEdge(int from,int to,int cap)
{
    Edge r;
    r.from=from;
    r.to=to;
    r.cap=cap;
    r.flow=;
    edges.push_back(r);
    Edge d;
    d.from=to;
    d.to=from;
    d.cap=;
    d.flow=;
    edges.push_back(d);
    m=edges.size();
    G[from].push_back(m-);
    G[to].push_back(m-);
}

//每个阶段来一次DFS增广
int DFS(int x,int a)
{
    if(x==t||a==) return a;
    int flow=,f;
    for(int i=cur[x]; i<G[x].size(); i++)
    {
        Edge& e=edges[G[x][i]];
        if(d[x]+==d[e.to]&&(f=DFS(e.to,min(a,e.cap-e.flow)))>)
        {
            e.flow+=f;
            edges[G[x][i]^].flow-=f;
            flow+=f;
            a-=f;
            if(a==) break;
        }
    }
    return flow;
}

//多个阶段，多次建立层次网络。
int Maxflow(int ss,int tt)
{
    int flow=;
    while(BFS())
    {
        memset(cur,,sizeof(cur));
        flow+=DFS(ss,INF);
    }
    return flow;
}

int N,M,D,Tot;
char Map1[][],Map2[][];
int B[][];
struct Zhu
{
    int x,y;
    int w;
} zhu[];

int main()
{
    int TTT;
    scanf("%d",&TTT);
    for(int YYY=;YYY<=TTT;YYY++)
    {
        scanf("%d%d",&N,&D);
        memset(B,,sizeof(B));
        for(int i=; i<maxn; i++) G[i].clear();
        edges.clear();
        Tot=;
        for(int i=; i<N; i++) scanf("%s",Map1[i]);
        for(int i=; i<N; i++) scanf("%s",Map2[i]);
        M=strlen(Map1[]);

        for(int i=; i<N; i++)
            for(int j=; j<M; j++)
                if(Map1[i][j]!='')
                {
                    zhu[Tot].x=i;
                    zhu[Tot].y=j;
                    zhu[Tot].w=Map1[i][j]-'';
                    B[i][j]=Tot;
                    Tot++;
                }
        s=;
        t=;
        Tot--;
        for(int i=; i<=Tot; i++)
        {
            int X=zhu[i].x,Y=zhu[i].y;
            AddEdge(i,i+Tot,zhu[i].w);
            if(min(min(X+,N-X),min(Y+,M-Y))<=D)
                AddEdge(i+Tot,t,INF);
        }

        for(int i=; i<=Tot; i++)
            for(int j=; j<=Tot; j++)
            {
                if(i==j) continue;
                int Ju=abs(zhu[i].x-zhu[j].x)+abs(zhu[i].y-zhu[j].y);
                if(Ju<=D) AddEdge(i+Tot,j,INF);
            }
        int FF=;
        for(int i=; i<N; i++)
            for(int j=; j<M; j++)
                if(Map2[i][j]=='L')
                {
                    AddEdge(s,Tot+Tot+FF,);
                    AddEdge(Tot+Tot+FF,B[i][j],);
                    FF++;
                }
        FF--;
        printf("Case #%d: ",YYY);
        int ANS=FF-Maxflow(s,t);
        if(ANS==) printf("no lizard was left behind.\n");
        else if(ANS==) printf("1 lizard was left behind.\n");
        else printf("%d lizards were left behind.\n",ANS);
    }
    return ;
}