POJ 2195 Going Home(网络流-费用流)
来源:互联网 发布:ubuntu换源163 编辑:程序博客网 时间:2024/06/06 02:12
Going Home
Time Limit: 1000MS Memory Limit: 65536KTotal 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.
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.mH.5 5HH..m...............mm..H7 8...H.......H.......H....mmmHmmmm...H.......H.......H....0 0
Sample Output
21028
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=0; char a[110]; vector < pair<int,int> > house,man; for(int i=0;i<n;i++){ scanf("%s",&a); for(int j=0;j<m;j++){ if(a[j]=='H') house.push_back(make_pair(i,j)); else if(a[j]=='m') man.push_back(make_pair(i,j)); } } sink=house.size()+man.size()+1; for(int i=1;i<=man.size();i++) adde(src,i,1,0); for(int i=1;i<=man.size();i++){ for(int j=1;j<=house.size();j++){ int tdis=abs(man[i-1].first-house[j-1].first)+abs(man[i-1].second-house[j-1].second); adde(i,j+man.size(),1,tdis); } } for(int i=1;i<=house.size();i++) adde(i+man.size(),sink,1,0);}void solve(){ printf("%d\n",getMinCost());}int main(){ while(scanf("%d%d",&n,&m)!=EOF && (m||n) ){ input(); solve(); } return 0;}
1 0
- POJ 2195 Going Home(网络流-费用流)
- POJ 2195 Going Home (网络流之最小费用流)
- POJ 2195 Going Home(费用流)
- poj 2195 Going Home (费用流)
- [费用流] POJ 2195 Going Home
- poj 2195 Going Home (费用流/KM)
- poj 2195 Going Home【zkw费用流】
- POJ 2195 Going Home(费用流)
- [POJ 2195]Going Home[费用流]
- Poj 2195 Going Home【费用流Min_Cost_Max_flow】
- POJ 2195 Going Home <最小费用流>
- Poj 2195 Going Home(费用流)
- POJ 2195 Going Home (费用流)
- POJ 2195 Going Home 最小费用流
- poj - 2195 - Going Home(最小费用最大流)
- poj 2195 Going Home(KM||费用流)
- poj 2195 Going Home(最小费用最大流)
- Going Home POJ 2195 (最小费用最大流)
- 同一页面无法多次使用XmlHttp发起Ajax请求
- Android Selector 与 Shape 基本用法
- HDU 4879 ZCC loves march(并查集+set)
- ViewPagerFragmentDemo
- 有关ndk、jni开发流程、数据类型、数组操作
- POJ 2195 Going Home(网络流-费用流)
- iptables 源码分析
- 石子合并(新算法)
- linux操作系统-Ubuntu
- tcpdump学习指南
- 用户空间的spi驱动
- 程序员 学习攻略
- 游戏中的心理学(三):如何突破印象关 提升初期留存
- 云南爆炸已经589人伤亡了!