poj 2195 Going Home 最小费最大流

#include<stdio.h>
#include<string.h>
#include<vector>
#include<queue>
#include<algorithm>
using namespace std;
const int N=1024;
const int inf=0x7fffffff;
struct Edge
{
    int from,to,cap,flow,cost;
};

struct node
{
    int x,y,d;
}t1,t2;
vector<Edge>edges;
vector<int>G[N];
int n,m;
int inq[N],p[N],d[N],a[N];
char g[128][128];
int mp[128][128],vis[128][128],gn,gm;
int dx[]={0,0,1,-1};
int dy[]={1,-1,0,0};
void AddEdge(int from, int to,int cap, int cost)
{
    Edge tp;
    tp.from=from,tp.to=to,tp.cap=cap,tp.flow=0,tp.cost=cost;
    edges.push_back(tp);

    tp.from=to,tp.to=from,tp.cap=0,tp.flow=0,tp.cost=-cost;
    edges.push_back(tp);

    int g=edges.size();
    G[from].push_back(g-2);
    G[to].push_back(g-1);
}

int BellmanFord(int s,int t,int &flow, int &cost)
{
    int i,j,u;
    for(i=0; i<=n+1; i++) d[i]=inf;
    memset(inq,0,sizeof(inq));
    d[s]=0;
    inq[s]=1;
    p[s]=0;
    a[s]=inf;
    queue<int>Q;
    Q.push(s);
    while(!Q.empty())
    {
        u=Q.front();
        Q.pop();
        inq[u]=0;
        for(i=0; i<G[u].size(); i++)
        {
            Edge &e=edges[G[u][i]];
            if(e.cap>e.flow&&d[e.to]>d[u]+e.cost)
            {
                d[e.to]=d[u]+e.cost;
                p[e.to]=G[u][i];
                a[e.to]=min(a[u],e.cap-e.flow);
                if(!inq[e.to])
                {
                    Q.push(e.to);
                    inq[e.to]=1;
                }
            }
        }
    }
    if(d[t]==inf) return 0;
    flow+=a[t];
    cost+=d[t]*a[t];
    u=t;
    while(u!=0)
    {
        edges[p[u]].flow+=a[t];
        edges[p[u]^1].flow-=a[t];
        u=edges[p[u]].from;
    }
    return 1;
}

int Mincost(int s,int t)
{
    int flow=0,cost=0;
    while(BellmanFord(s,t,flow,cost));
    return cost;
}

void bfs(int x,int y,int u)
{
    int i,j;
    t1.x=x;
    t1.y=y;
    t1.d=0;
    memset(vis,0,sizeof(vis));
    queue<node>q;
    q.push(t1);
    vis[x][y]=1;
    while(!q.empty())
    {
        t1=q.front();
        q.pop();
        for(i=0;i<4;i++)
        {
            t2.x=t1.x+dx[i];
            t2.y=t1.y+dy[i];
            t2.d=t1.d+1;
            if(t2.x<0||t2.x>=gn||t2.y<0||t2.y>=gm) continue;
            if(vis[t2.x][t2.y]) continue;
            if(g[t2.x][t2.y]=='H')
            {
                AddEdge(u,mp[t2.x][t2.y],1,t2.d);
            }
            vis[t2.x][t2.y]=1;
            q.push(t2);
        }
    }
}

int main()
{
    int i,j,u,v,c;
    while(~scanf("%d%d",&gn,&gm))
    {
        if(gn==0&&gm==0) break;
        n=1;
        for(i=0; i<N; i++)
            G[i].clear();
        edges.clear();
        for(i=0;i<gn;i++)
        {
            scanf("%s",g[i]);
            for(j=0;j<gm;j++)
            {
                if(g[i][j]=='m'||g[i][j]=='H')
                    mp[i][j]=n++;
            }
        }

        for(i=0;i<gn;i++)
            for(j=0;j<gm;j++)
        {
            if(g[i][j]=='m')
            {
                AddEdge(0,mp[i][j],1,0);
                bfs(i,j,mp[i][j]);
            }
            else if(g[i][j]=='H')
                AddEdge(mp[i][j],n+1,1,0);
        }
        printf("%d\n",Mincost(0,n+1));
    }
    return 0;
}