D - Going Home

Time Limit:1000MS     Memory Limit:65536KB     64bit IO Format:%I64d & %I64u

Appoint description:
 

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 尼玛心累啊,为什么从源点链接房子,在链接人在链接会点jiu不行,,,,,,必须按照源点---》ren---》房子,,,,会点的顺序建图
还有数组额外注意,
尼玛了,因为数组开小,wa了14个小时,,,,,
#include<stdio.h>
#include<string.h>
#include<iostream>
#include<math.h>
#include<vector>
#include<map>
#include<algorithm>
#include<queue>
using namespace std;
const int maxn=;
const int maxm=;
const int inf=0x3f3f3f3f;
struct Edge{
int to;
int next;
int cap,flow,cost;
}edge[maxm];
int head[maxn],tot;
int pre[maxn],dis[maxn];
bool vis[maxn];
int n;
char str[];
struct node{
int x,y; }p[maxn],q[maxn]; void init(int nn){
n=nn;
tot=;
memset(head,-,sizeof(head));
}
void addedge(int u,int v,int cap,int cost){
edge[tot].to=v;
edge[tot].cap=cap;
edge[tot].cost=cost;
edge[tot].flow=;
edge[tot].next=head[u];
head[u]=tot++;
edge[tot].to=u;
edge[tot].cap=;
edge[tot].cost=-cost;
edge[tot].flow=;
edge[tot].next=head[v];
head[v]=tot++;
}
bool spfa(int s,int t){
queue<int >q;
// printf("n====%d\n",n);
for(int i=;i<=n;i++){
dis[i]=inf;
vis[i]=false;
pre[i]=-;
}
dis[s]=;
vis[s]=true;
q.push(s);
while(!q.empty()){
int u=q.front();
q.pop();
vis[u]=false;
for(int i=head[u];i!=-;i=edge[i].next){
int v=edge[i].to;
if(edge[i].cap>edge[i].flow&&dis[v]>dis[u]+edge[i].cost){
dis[v]=dis[u]+edge[i].cost;
pre[v]=i;
if(!vis[v]){
vis[v]=true;
q.push(v);
} }
} }
if(pre[t]==-)
return false;
else
return true; }
int mincost(int s,int t,int &cost){
int flow=;
cost=;
// printf("%d\n",head[2]);
while(spfa(s,t)){
int Min=inf;
for(int i=pre[t];i!=-;i=pre[edge[i^].to]){
if(Min>edge[i].cap-edge[i].flow)
Min=edge[i].cap-edge[i].flow;
}
for(int i=pre[t];i!=-;i=pre[edge[i^].to]){
edge[i].flow+=Min;
edge[i^].flow-=Min;
cost+=edge[i].cost*Min; }
flow+=Min; } // printf("cost=====%d flow======%d\n",cost,flow);
return flow;
} int main(){
int x,y;
while(scanf("%d%d",&x,&y)!=EOF){
if(x==&&y==)
break;
n=x*y+;
init(n);
int start=;
int end=n;
int pp=,qq=;
for(int i=;i<=x;i++){
scanf("%s",str+);
for(int j=;j<=y;j++){
int cnt=(i-)*y+j;
if(str[j]=='m'){
addedge(start,cnt,,);
p[pp].x=i;
p[pp++].y=j;
}
if(str[j]=='H'){
addedge(cnt,end,,);
q[qq].x=i;
q[qq++].y=j;
}
}
// printf("%s\n",str+1);
} for(int i=;i<pp;i++){
for(int j=;j<qq;j++){
addedge((p[i].x-)*y+p[i].y,(q[j].x-)*y+q[j].y,,abs(p[i].x-q[j].x)+abs(p[i].y-q[j].y));
}
}
int tmp;
int ans=mincost(start,end,tmp);
printf("%d\n",tmp); }
return ;
}
5634445 qwerqqq D
Accepted
1188 110 2650
5 min ago
5634440 qwerqqq D
Wrong Answer
    2650
5 min ago
5634430 qwerqqq D
Accepted
1188 125 2650
6 min ago
5634424 qwerqqq D
Accepted
1188 110 2654
7 min ago
5634358 qwerqqq D
Accepted
1188 125 2654
12 min ago
5634345 qwerqqq D
Accepted
1192 110 2654
12 min ago
5634339 qwerqqq D
Accepted
1188 110 2655
12 min ago
5634334 qwerqqq D
Accepted
1228 110 2655
13 min ago
5634307 qwerqqq D
Accepted
1540 110 2656
16 min ago
5634289 qwerqqq D
Wrong Answer
    2651
17 min ago
5634263 qwerqqq D
Time Limit Exceeded
    2647
19 min ago
5634250 qwerqqq D
Wrong Answer
    2647
21 min ago
5634209 qwerqqq D
Wrong Answer
    3005
24 min ago
5634202 qwerqqq D
Time Limit Exceeded
    3005
24 min ago
5631907 qwerqqq D
Wrong Answer
    2662
14 hr ago

POJ 2195 Going Home 最小费用最大流 尼玛,心累的更多相关文章

  1. POJ 2195 - Going Home - [最小费用最大流][MCMF模板]

    题目链接:http://poj.org/problem?id=2195 Time Limit: 1000MS Memory Limit: 65536K Description On a grid ma ...

  2. poj 2195 Going Home(最小费用最大流)

    题目:http://poj.org/problem?id=2195 有若干个人和若干个房子在一个给定网格中,每人走一个都要一定花费,每个房子只能容纳一人,现要求让所有人进入房子,且总花费最小. 构造一 ...

  3. poj 2351 Farm Tour (最小费用最大流)

    Farm Tour Time Limit: 1000MS   Memory Limit: 65536K Total Submissions: 17230   Accepted: 6647 Descri ...

  4. POJ 2157 Evacuation Plan [最小费用最大流][消圈算法]

    ---恢复内容开始--- 题意略. 这题在poj直接求最小费用会超时,但是题意也没说要求最优解. 根据线圈定理,如果一个跑完最费用流的残余网络中存在负权环,那么顺着这个负权环跑流量为1那么会得到更小的 ...

  5. poj 2135 Farm Tour 最小费用最大流建图跑最短路

    题目链接 题意:无向图有N(N <= 1000)个节点,M(M <= 10000)条边:从节点1走到节点N再从N走回来,图中不能走同一条边,且图中可能出现重边,问最短距离之和为多少? 思路 ...

  6. POJ 3680: Intervals【最小费用最大流】

    题目大意:你有N个开区间,每个区间有个重量wi,你要选择一些区间,使得满足:每个点被不超过K个区间覆盖的前提下,重量最大 思路:感觉是很好想的费用流,把每个区间首尾相连,费用为该区间的重量的相反数(由 ...

  7. POJ 2135 Farm Tour [最小费用最大流]

    题意: 有n个点和m条边,让你从1出发到n再从n回到1,不要求所有点都要经过,但是每条边只能走一次.边是无向边. 问最短的行走距离多少. 一开始看这题还没搞费用流,后来搞了搞再回来看,想了想建图不是很 ...

  8. [poj] 1235 Farm Tour || 最小费用最大流

    原题 费用流板子题. 费用流与最大流的区别就是把bfs改为spfa,dfs时把按deep搜索改成按最短路搜索即可 #include<cstdio> #include<queue> ...

  9. POJ 2516 Minimum Cost [最小费用最大流]

    题意略: 思路: 这题比较坑的地方是把每种货物单独建图分开算就ok了. #include<stdio.h> #include<queue> #define MAXN 500 # ...

随机推荐

  1. JavaWeb学习笔记——表达式语言

    使用表达式语言,可以方便地访问标志位(JSP中有page(pageContext).request.session和application4种标志位)中的属性内容,可以避免出现许多的Scriptlet ...

  2. (转)HBase 的原理和设计

    转自:HBase的原理和设计 HBase架构:

  3. Tomcat 开发web项目报Illegal access: this web application instance has been stopped already. Could not load [org.apache.commons.pool.impl.CursorableLinkedList$Cursor]. 错误

    开发Java web项目,在tomcat运行后报如下错误: Illegal access: this web application instance has been stopped already ...

  4. php生成excle

    方法一: 新建index.php,代码如下 <?php header("Content-type:application/vnd.ms-excel"); header(&qu ...

  5. memcached命令行操作详解,命令选项的详细解释

    连接到memcached命令行下:  telnet 127.0.0.1 11211 1.set / add / replace : 格式:<command> <key> < ...

  6. java中的各个数据结构区别

    ArrayList 和Vector是采用数组方式存储数据,此数组元素数大于实际存储的数据以便增加和插入元素,都允许直接序号索引元素,但是插入数据要设计到数组元素移动等内存操作,所以索引数据快插入数据慢 ...

  7. Tomcat编码问题及访问软链接文件设置

    Tomcat编码问题及访问软链接文件设置 一.编码问题:让其支持UTF-8格式 修改tomcat中server.xml Connector port=" protocol="org ...

  8. 大学站防SQL注入代码(ASP版)

    方法1: Replace过滤字符 解决方法:查找login.asp下的<from找到下边的类似username=request.Form(”name”) pass=request.Form(”p ...

  9. Css常用收集

    /*-------------------------------------- 圆角*/ -webkit-border-radius: 4px;  -moz-border-radius: 4px; ...

  10. 安装RabbitMQ遇到的问题

    消息队列RabbitMQ在安装的时候出现了问题.. 我这里是参考的 .NET 环境中使用RabbitMQ 进行安装的..首先声明 这篇博文没有问题.. 但是在我安装的时候发现..ErLang环境装完 ...