首页 > 代码库 > POJ 2195 Going Home（网络流-费用流）

POJ 2195 Going Home（网络流-费用流）

2024-07-16 03:38:10   229人阅读

Going Home
Time Limit: 1000MS Memory Limit: 65536K
Total Submissions: 17777 Accepted: 9059

Description

On a grid map there are n little men and n houses. In each unit time, every little man can move one unit step, either horizontally, or vertically, to an adjacent point. For each little man, you need to pay a $1 travel fee for every step he moves, until he enters a house. The task is complicated with the restriction that each house can accommodate only one little man. 

Your task is to compute the minimum amount of money you need to pay in order to send these n little men into those n different houses. The input is a map of the scenario, a ‘.‘ means an empty space, an ‘H‘ represents a house on that point, and am ‘m‘ indicates there is a little man on that point. 

You can think of each point on the grid map as a quite large square, so it can hold n little men at the same time; also, it is okay if a little man steps on a grid with a house without entering that house.

Input

There are one or more test cases in the input. Each case starts with a line giving two integers N and M, where N is the number of rows of the map, and M is the number of columns. The rest of the input will be N lines describing the map. You may assume both N and M are between 2 and 100, inclusive. There will be the same number of ‘H‘s and ‘m‘s on the map; and there will be at most 100 houses. Input will terminate with 0 0 for N and M.

Output

For each test case, output one line with the single integer, which is the minimum amount, in dollars, you need to pay.

Sample Input

2 2
.m
H.
5 5
HH..m
.....
.....
.....
mm..H
7 8
...H....
...H....
...H....
mmmHmmmm
...H....
...H....
...H....
0 0

Sample Output

2
10
28

Source

Pacific Northwest 2004

题目大意：

m表示人，H表示房子，它们之间的距离是曼哈顿距离，问你所有人一人个房子的总花费是多少？


解题思路：

用最小费用流即可。构图略。


解题代码：

#include <iostream>
#include <cstdio>
#include <queue>
#include <cstring>
#include <cstdlib>
#include <algorithm>
using namespace std;

const int maxn=11000;
const int maxm=1100000;
const int inf=(1<<30);

struct edge{
    int u,v,next,f,c;
    edge(int u0=0,int v0=0,int f0=0,int c0=0,int next0=0){
        u=u0,v=v0,f=f0,c=c0,next=next0;
    }
}e[maxm];

int head[maxn],path[maxn],dist[maxn];
bool visited[maxn];
int cnt,src,sink;

void init(){
    cnt=0;
    memset(head,-1,sizeof(head));
}

void adde(int u,int v,int f,int c){
    e[cnt].u=u,e[cnt].v=v,e[cnt].f=f,e[cnt].c=c,e[cnt].next=head[u],head[u]=cnt++;
    e[cnt].u=v,e[cnt].v=u,e[cnt].f=0,e[cnt].c=-c,e[cnt].next=head[v],head[v]=cnt++;
}

bool bfs(){
     for(int i=src;i<=sink;i++){
        dist[i]=inf;
        path[i]=-1;
     }
     dist[src]=0;
     queue <int> q;
     q.push(src);
     visited[src]=true;
     while(!q.empty()){
         int s=q.front();
         q.pop();
         for(int i=head[s];i!=-1;i=e[i].next){
              int d=e[i].v;
              if(e[i].f>0 && dist[s]+e[i].c<dist[d]){
                 dist[d]=dist[s]+e[i].c;
                 path[d]=i;
                 if(!visited[d]){
                    visited[d]=true;
                    q.push(d);
                 }
              }
         }
         visited[s]=false;
     }
     return path[sink]>=0;
}

int getMinCost(){
    int ret=0;
    while(bfs()){
        int delta=inf;
        for(int i=sink;i!=src;i=e[path[i]].u){
            if( e[path[i]].f<delta ) delta=e[path[i]].f;
        }
        for(int i=sink;i!=src;i=e[path[i]].u){
            e[path[i]].f-=delta;
            e[path[i]^1].f+=delta;
        }
        ret+=dist[sink]*delta;
    }
    return ret;
}

int n,m;

void input(){
    init();
    src=http://www.mamicode.com/0;>


联系
我们