poj 2195 最小费用最大流模板

/*Source Code

Problem: 2195  User: HEU_daoguang

Memory: 1172K  Time: 94MS

Language: G++  Result: Accepted

Source Code

*/

#include <iostream>

#include <stdio.h>

#include <queue>

#include <math.h>

#include <string.h>

using namespace std;

#define V 6005

#define E 10010000

#define inf 999999999

int n,m;

char map[][];

int hp[V][],mp[V][];

int vis[V];

int dist[V];

int pre[V];

struct Edge{

    int u,v,c,cost,next;

}edge[E];

int head[V],cnt;

void init(){

    cnt=;

    memset(head,-,sizeof(head));

}

void addedge(int u,int v,int c,int cost){

    edge[cnt].u=u;edge[cnt].v=v;edge[cnt].cost=cost;

    edge[cnt].c=c;edge[cnt].next=head[u];head[u]=cnt++;

    edge[cnt].u=v;edge[cnt].v=u;edge[cnt].cost=-cost;

    edge[cnt].c=;edge[cnt].next=head[v];head[v]=cnt++;

}

bool spfa(int begin,int end){

    int u,v;

    queue<int> q;

    for(int i=;i<=end+;i++){

        pre[i]=-;

        vis[i]=;

        dist[i]=inf;

    }

    vis[begin]=;

    dist[begin]=;

    q.push(begin);

    while(!q.empty()){

        u=q.front();

        q.pop();

        vis[u]=;

        for(int i=head[u];i!=-;i=edge[i].next){

            if(edge[i].c>){

                v=edge[i].v;

                if(dist[v]>dist[u]+edge[i].cost){

                    dist[v]=dist[u]+edge[i].cost;

                    pre[v]=i;

                    if(!vis[v]){

                        vis[v]=true;

                        q.push(v);

                    }

                }

            }

        }

    }

    return dist[end]!=inf;

}

int MCMF(int begin,int end){

    int ans=,flow;

    int flow_sum=;

    while(spfa(begin,end)){

        flow=inf;

        for(int i=pre[end];i!=-;i=pre[edge[i].u])

            if(edge[i].c<flow)

                flow=edge[i].c;

        for(int i=pre[end];i!=-;i=pre[edge[i].u]){

            edge[i].c-=flow;

            edge[i^].c+=flow;

        }

        ans+=dist[end]*flow;

        flow_sum+=flow;

    }

    return ans;

}

int main()

{

    //freopen("in.txt","r",stdin);

    while(scanf("%d%d",&n,&m)!=EOF){

        if(n== && m==) break;

        for(int i=;i<n;i++){

            scanf("%s",map[i]);

        }

        int hcnt=,mcnt=;

        for(int i=;i<n;i++)

            for(int j=;j<m;j++){

                if(map[i][j]=='H'){

                    hp[hcnt][]=i;

                    hp[hcnt][]=j;

                    hcnt++;

                }

                if(map[i][j]=='m'){

                    mp[mcnt][]=i;

                    mp[mcnt][]=j;

                    mcnt++;

                }

            }

        hcnt--;

        mcnt--;

        init();

        for(int i=;i<=hcnt;i++){

            addedge(,i,,);

            //addedge(i,0,1,0);

        }

        for(int j=;j<=mcnt;j++){

            addedge(hcnt+j,hcnt+mcnt+,,);

            //addedge(hcnt+mcnt+1,hcnt+j,1,0);

        }

        for(int i=;i<=hcnt;i++)

            for(int j=;j<=mcnt;j++){

                addedge(i,hcnt+j,,fabs(hp[i][]-mp[j][])+fabs(hp[i][]-mp[j][]));

                //addedge(hcnt+j,i,1,fabs(hp[i][0]-mp[j][0])+fabs(hp[i][1]-mp[j][1]));

            }

        int res=MCMF(,hcnt+mcnt+);

        printf("%d\n",res);

    }

    return ;

}

/*

2

.m

H.

5

HH..m

.....

.....

.....

mm..H

8

...H....

...H....

...H....

mmmHmmmm

...H....

...H....

...H....

20

..mm..H..H.H...HHH.m

m.H...H.....H......m

..H...mm.........m..

Hm.m..H.H...H..m....

mH.Hm....mH........H

m............m......

.m..H...........H..m

H.m.H.....H.......m.

...m..Hm.....m.H...H

..H...H....H......mH

..m.m.....m....mm...

..........H.......H.

...mm......m...H....

.....m..H.H......m.m

.H......mm.H.m.m.m.m

HH..........HH..HH..

...m..H........Hm...

....H.....H...mHm...

H...........m......m

....m...H.m.....m...

20

...Hm.m.HHH...Hmm...

.H........m.......H.

.......H...H.H......

....HmH.m....Hm..m..

....m..m............

H..H.........m....H.

.m.H...m...mH.m..H..

.mH..H.H......m...m.

...mH...H.......m...

..Hm..H..H......m.m.

..mH...H.m..m.H..HH.

m.m......m........m.

...mH..m.....mH.....

....m.H.H..........H

....H.......H....m.H

H.mH.......m.......H

..............m.HH.H

..H.........m.m.m...

.........mH.....mmm.

...mH.m.m.....H..m..

20

H.H.......H....m....

.....m..H......H..H.

...H..............m.

mH..mm..m...H.......

......H....mm.H.....

.mH..mm.....mH.H...H

.........HHH........

......H.H...mm......

.m..m.H...mHmm...HH.

mm..Hmm.H..m...m.H.m

H.Hm.m.m.....m......

...........m.......H

......m......H...m..

....H..........Hm...

.H..H.m....m........

...H....Hm..........

m.H.mHm.m.m...H...H.

.m..........m.......

H......H...HmHHm..H.

..H..m.m...m.H..H...

20

.m..m..Hm...........

.m..H.H...m.m.m...H.

........m..mH....H..

..H...........Hm.H.m

H..H.m........mm..m.

H.......m...........

..m..Hmmmm...m..mH..

..H.Hm...H..........

H....m.......mm.....

....m..m.....m.....m

.H.m.H...H.....H....

.m........mm..H...H.

..m.......H.mH..mm.H

.......Hm...HH....H.

...mm....HHH........

..H.m..H........m...

H.........H.........

HH.H.....m.H..Hm....

...H.m...H.Hm.....m.

.H..mH..H..H........

20

m.........m.......m.

..m.H....m....m...m.

m...H.m.....H.H.....

.....H.Hm.m...m.....

..mH...H.H.m.H...H..

H....H......m.....m.

..................H.

.m..m.Hm......m..H..

....H..H.m.....H...H

....m.H......m.H...m

....HH...H...H......

..H.....m......H.H..

mmH...mmm.....m.....

..m.......m...mmH...

......H.H..m...Hm..H

HHHm.H.m........H...

...mHm.......m....m.

.....mmH.H..H.....m.

......m..H.....m...H

..HH..m...mH......H.

20

m.HHm..HH..m.mHm....

mm..H...............

m...HH.......m.H....

..mH.m.m.......mmH..

H.m........m.......H

m.H....m....m..m...H

....m......mm.......

.m.H....m..H..m..H..

H....m......H.......

...H...........m.m.H

......H...m...H..m..

.mH..H.H.....m......

...m.....m.H...HmH.H

m.......H..H.H..mm.H

...H.........Hm.HH..

.m....H.....m.HHm...

...HHH...........m..

m............H......

.....m..mm.....m....

.....m..H..H..H....H

20

....H.............m.

.....HH..mH..Hm..H..

m...........mH....mm

..m..m.H......m....m

.H..........mHH....m

...........m..H.m...

..H...H.........mHm.

......H...........H.

H.....H.....H..m....

H.H..H..m...m..mH.m.

....H...m.H.mHmm.mHm

..mmm...H....m....H.

.........m..m.......

.m.H....Hm....m.....

.....H.......HH...mH

..H..H....m.m.....HH

.Hm.............H...

H...Hm.......H.m.m..

.....m..HH...H.....m

........mHmmH..m....

20

.....H.......H...m.m

.m..H.m.m....m......

m.H.HHH..mm.........

H...mH.mH...........

..mHm..m.m......m..m

H.HH.....m...m......

H.mH....H......H....

...mH.m.mHmH...H....

........H.....m.....

..H.......HmH...H...

......m...HH.m......

.H..m.H...H.........

...H...m..m..m...m..

.mH..HH......m...H..

...m....H.H.H.m.....

.........H.m........

..m..H...H......H...

mmH..mH.....m.H..H..

H....mm...H.m...m.mm

......m.............

20

....mH..m...m.....m.

..m......mHm...H....

.H.....mHm....H..H..

...HH..........m.m..

..m..mm........m....

...m.....H..........

..mH..H...m.........

...H.H.....m..mH..m.

..H.........Hm.Hm..H

...........H......m.

.............H...mm.

H.m.....Hm.H.m......

....Hm..m..mm.H...m.

...H.H.H......H.Hm..

H.m............m....

..mH.m.m...m..H.m..H

HH.H....m.H..H...m..

.....H.....H...H...H

........mH.HHm.....m

.H.H.....mmH......m.

20

.mH........m.mmH..H.

m....H........H..H..

.........Hm.m.m.....

....H.H...m.........

.H....m.............

HH.....H.....H.HH...

mmmmmm.H..m..m......

.Hm.H...H.H..m.H....

.........m..m.mHmHH.

...m.m....m..H.Hm..H

...Hm....H..m....m..

...mH.....m.......m.

.H...HmmH..H.....H..

m.H...m.....mmH....H

.m.H......m...H.....

H........m..Hm......

.......m...........m

...m........m...H...

.........m...H......

HH..H..m...H......H.

*/

上面的网上大牛的代码，我看的好像和我的模板差不多，还有测试样例，我就复了一下，下面的是我的代码

Going Home

Time Limit: 1000MS		Memory Limit: 65536K
Total Submissions: 19827		Accepted: 10080

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

Source

Pacific Northwest 2004、

求得就是每个人需要到每个房子里，一个房子只能装下一个人，问最少的开销，没走一个单元格的花费就以一元

可以直接建图，建出每个人到各个房子的距离，连成一条边，流量cap为1，花费cost为dis，即为横坐标的绝对值差加上纵坐标的绝对值差；

之后建立一个超级原点和一个超级会点，让超级原点连到每一个人，cap为1，cost为0，同理让每一个房子链接到超级汇点，cap为1，cost为0

之后跑框斌的最小费用最大流算法模板就可以过了，还要注意个问题就是总的点数为cnth+cntm+2

还有一个需要注意的地方是本题的范围是100*100；

所以点和边的数值尽量开的大一些

下面贴上代码

#include<stdio.h>

#include<string.h>

#include<iostream>

#include<algorithm>

#include<queue>

#include<math.h>

#include<vector>

using namespace std;

//最小费用最大流，求最大费用只需要取相反数，结果取相反数即可。

//点的总数为 N，点的编号 0~N-1

const int MAXN = ;

const int MAXM = ;

const int INF = 0x3f3f3f3f;

struct Edge

{

    int to,next,cap,flow,cost;

} edge[MAXM];

int head[MAXN],tol;

int pre[MAXN],dis[MAXN];

bool vis[MAXN];

int N;//节点总个数，节点编号从0~N-1

void init()

{

    tol = ;

    memset(head,-,sizeof (head));

}

void addedge (int u,int v,int cap,int cost){

    edge[tol].to = v;

    edge[tol].cap = cap;

    edge[tol].cost = cost;

    edge[tol].flow = ;

    edge[tol].next = head[u];

    head[u] = tol++;

    edge[tol].to = u;

    edge[tol].cap = ;

    edge[tol].cost = -cost;

    edge[tol].flow = ;

    edge[tol].next = head[v];

    head[v] = tol++;

}

bool spfa(int s,int t)

{

    queue<int>q;

    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;

}

//返回的是最大流，cost存的是最小费用

int minCostMaxflow(int s,int t,int &cost)

{

    int flow = ;

    cost = ;

    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;

    }

    return flow;

}

char map[];

struct node1{

    int x, y;

}hh[];

struct node2{

     int x,y;

}mm[];

int main(){

   int n,m,sta;

   while(scanf("%d%d",&n,&m)!=EOF){

       if(n==&&m==)

       break;

       memset(hh,,sizeof(hh));

       memset(mm,,sizeof(mm));

       memset(map,,sizeof(map));

       memset(pre,,sizeof(pre));

       memset(dis,,sizeof(dis));

       memset(vis,false,sizeof(vis));

       memset(edge,,sizeof(edge));

       memset(hh,,sizeof(hh));

       memset(mm,,sizeof(mm));

    init();

      int u,v,w;

      int cnth=,cntm=;

    for(int i=;i<n;i++){

       scanf("%s",map);

       for(int j=;j<m;j++){

           if(map[j]=='H'){

               hh[++cnth].x=i;

               hh[cnth].y=j;

           }

           if(map[j]=='m'){

               mm[++cntm].x=i;

               mm[cntm].y=j;

           }

       }

    }

    N=cntm+cnth+;

    for(int i=;i<=cntm;i++){

        for(int j=;j<=cnth;j++){

             addedge(i,j+cntm,,abs(mm[i].x-hh[j].x)+abs(mm[i].y-hh[j].y));

             addedge(j+cntm,i,,abs(mm[i].x-hh[j].x)+abs(mm[i].y-hh[j].y));

        }

    }

    int ans1=;

    for(int i=;i<=cntm;i++){

    addedge(,i,,);

    }

    for(int j=cntm+;j<=cnth+cntm;j++){

        addedge(j,cnth+cntm+,,);

    }

      int temp=minCostMaxflow(,cnth+cntm+,ans1);

      printf("%d\n",ans1);

   }

}

poj 2195 最小费用最大流模板的更多相关文章

POJ - 2195 最小费用最大流
题意:每个人到每个房子一一对应,费用为曼哈顿距离,求最小的费用题解:单源点汇点最小费用最大流,每个人和房子对于建边 #include<map> #include<set> # ...
图论算法-最小费用最大流模板【EK;Dinic】
图论算法-最小费用最大流模板[EK;Dinic] EK模板 const int inf=1000000000; int n,m,s,t; struct node{int v,w,c;}; vector ...
HDU3376 最小费用最大流模板2
Matrix Again Time Limit: 5000/2000 MS (Java/Others) Memory Limit: 102400/102400 K (Java/Others)To ...
洛谷P3381 最小费用最大流模板
https://www.luogu.org/problem/P3381 题目描述如题,给出一个网络图,以及其源点和汇点,每条边已知其最大流量和单位流量费用,求出其网络最大流和在最大流情况下的最小费用 ...
最大流 && 最小费用最大流模板
模板从这里搬运,链接博客还有很多网络流题集题解参考. 最大流模板 ( 可处理重边 ) ; const int INF = 0x3f3f3f3f; struct Edge { int from ...
POJ 2135 Farm Tour （最小费用最大流模板）
题目大意: 给你一个n个农场,有m条道路,起点是1号农场,终点是n号农场,现在要求从1走到n,再从n走到1,要求不走重复路径,求最短路径长度. 算法讨论: 最小费用最大流.我们可以这样建模:既然要求不 ...
最小费用最大流模板（POJ 2135-Farm Tour）
最近正好需要用到最小费用最大流,所以网上就找了这方面的代码,动手写了写,先在博客里存一下~ 代码的题目是POJ2135-Farm Tour 需要了解算法思想的,可以参考下面一篇文章,个人觉得有最大流基 ...
Doctor NiGONiGO’s multi-core CPU（最小费用最大流模板）
题目链接:http://acm.nyist.net/JudgeOnline/problem.php?pid=693 题意:有一个 k 核的处理器和 n 个工作,全部的工作都须要在一个核上处理一个单位的 ...
【网络流#2】hdu 1533 - 最小费用最大流模板题
最小费用最大流,即MCMF(Minimum Cost Maximum Flow)问题嗯~第一次写费用流题... 这道就是费用流的模板题,找不到更裸的题了建图:每个m(Man)作为源点,每个H(Ho ...

随机推荐

【Python图像特征的音乐序列生成】解析ABC格式的文件（修改版）
ABC格式,是一个音乐标准,ABC Plus Project最新的标准是2.x. ABC格式的音乐长成这样: X: T:Abacus % Nottingham Music Database S:By ...
【Windows 10 v1703】解决桌面出现Removable Storage Devices的问题
症状如下: 右键没有正常菜单,不能查看属性. 不能通过文件树找到这个文件夹. 出现原因不明. 暂时的解决方案: 右键,新建一个快捷方式.然后将快捷方式拖进垃圾桶,删除.这个文件夹将会被连带删除. 感谢 ...
python爬虫之路——初识基本页面构造原理
通过chrome浏览器的使用简单介绍网页构成 360浏览器使用右键审查元素,Chrome浏览器使用右键检查,都可查看网页代码. 网页代码有两部分:HTML文件和CSS样式.其中有<script& ...
Codeforces 464E #265 (Div. 1) E. The Classic Problem 主席树+Hash
E. The Classic Problem http://codeforces.com/problemset/problem/464/E 题意:给你一张无向带权图,求S-T的最短路,并输出路径.边权 ...
cv2.minAreaRect() 生成最小外接矩形
简介使用python opencv返回点集cnt的最小外接矩形,所用函数为 cv2.minAreaRect(cnt) ,cnt是所要求最小外接矩形的点集数组或向量,这个点集不定个数. cv2 ...
Problem A: 文件操作--二进制文件读入
Problem A: 文件操作--二进制文件读入 Time Limit: 1 Sec Memory Limit: 128 MBSubmit: 1952 Solved: 524[Submit][St ...
python基础一 day14 生成器函数进阶（1）
解决在matplotlib使用中文的问题
原生的matplotlib并不支持直接使用中文,而需要修改一下相应的文件,上网搜了下,找到一个最简洁的办法. NO.1 找到matplotlibrc文件 C:\Python26\Lib\site-pa ...
Spring学习笔记之Spring概述
概述 Spring是一个java应用最广的开源框架,它是于2003 年兴起的一个轻量级的Java 开发框架,由Rod Johnson 在其著作Expert One-On-One J2EE Deve ...
Linux菜鸟起飞之路【八】文本编辑器
在Linux中,文本编辑器有两个,VI和VIM.这两个编辑器用法差不多,但vim是vi的升级版,所以功能更强大一些. vim编辑器一共有三种模式,命令行模式.编辑模式和扩展模式. 进入vim界面,首先 ...

poj 2195 最小费用最大流模板

poj 2195 最小费用最大流模板的更多相关文章

随机推荐

热门专题