hdu1045(二分图)

原创 2016年05月31日 21:08:32

Fire Net

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 9579    Accepted Submission(s): 5579


Problem Description
Suppose that we have a square city with straight streets. A map of a city is a square board with n rows and n columns, each representing a street or a piece of wall. 

A blockhouse is a small castle that has four openings through which to shoot. The four openings are facing North, East, South, and West, respectively. There will be one machine gun shooting through each opening. 

Here we assume that a bullet is so powerful that it can run across any distance and destroy a blockhouse on its way. On the other hand, a wall is so strongly built that can stop the bullets. 

The goal is to place as many blockhouses in a city as possible so that no two can destroy each other. A configuration of blockhouses is legal provided that no two blockhouses are on the same horizontal row or vertical column in a map unless there is at least one wall separating them. In this problem we will consider small square cities (at most 4x4) that contain walls through which bullets cannot run through. 

The following image shows five pictures of the same board. The first picture is the empty board, the second and third pictures show legal configurations, and the fourth and fifth pictures show illegal configurations. For this board, the maximum number of blockhouses in a legal configuration is 5; the second picture shows one way to do it, but there are several other ways. 



Your task is to write a program that, given a description of a map, calculates the maximum number of blockhouses that can be placed in the city in a legal configuration. 
 

Input
The input file contains one or more map descriptions, followed by a line containing the number 0 that signals the end of the file. Each map description begins with a line containing a positive integer n that is the size of the city; n will be at most 4. The next n lines each describe one row of the map, with a '.' indicating an open space and an uppercase 'X' indicating a wall. There are no spaces in the input file. 
 

Output
For each test case, output one line containing the maximum number of blockhouses that can be placed in the city in a legal configuration.
 

Sample Input
4 .X.. .... XX.. .... 2 XX .X 3 .X. X.X .X. 3 ... .XX .XX 4 .... .... .... .... 0
 

Sample Output
5 1 5 2 4

题意:‘X'是墙,现在要在空地上尽可能多的放置机关枪,可是在一片连续的空地上每行每列只能有一个机关枪,墙很厚,被墙隔着的可以视作不在同一行或同一列,要求最多的放置机关枪的数目。

思路:这题主要在于怎样去建图,和hdu5039这题建图方式一样,详细请看:http://blog.csdn.net/martinue/article/details/51286032


#include <iostream>
#include <stdio.h>
#include <stdlib.h>
#include<string.h>
#include<algorithm>
#include<math.h>
#include<queue>
#include<stack>
using namespace std;
typedef long long ll;
const int N=555;///两边的最大数量
bool tu[N][N];
int from[N];///记录右边的点如果配对好了它来自哪里
bool use[N];///记录右边的点是否已经完成了配对
int n,m;///m,n分别表示两边的各自数量,n是左边,m是右边
bool dfs(int x)
{
    for(int i=1; i<=m; i++) ///m是右边,所以这里上界是m
        if(!use[i]&&tu[x][i])
        {
            use[i]=1;
            if(from[i]==-1||dfs(from[i]))
            {
                from[i]=x;
                return 1;
            }
        }
    return 0;
}
int hungary()
{
    int tot=0;
    memset(from,-1,sizeof(from));
    for(int i=1; i<=n; i++) ///n是左边,所以这里上界是n
    {
        memset(use,0,sizeof(use));
        if(dfs(i))
            tot++;
    }
    return tot;
}
char a[10][10];
int p1[10][10];
int main()
{
    int x;
    while(~scanf("%d",&x)&&x)
    {
        memset(tu,0,sizeof(tu));
        memset(p1,0,sizeof(p1));
        for(int i=0; i<x; i++)
            scanf("%s",a[i]);
        int bj1=0,bj2=0,flag=0;
        for(int i=0; i<x; i++)
        {
            flag=0;
            for(int j=0; j<x; j++)
                if(!flag&&a[i][j]!='X')
                    p1[i][j]=++bj1,flag=1;
                else if(flag&&a[i][j]=='X')
                    flag=0;
                else if(flag&&a[i][j]!='X')
                    p1[i][j]=bj1;
        }
        for(int j=0; j<x; j++)
        {
            flag=0;
            for(int i=0; i<x; i++)
                if(!flag&&a[i][j]!='X')
                    bj2++,tu[p1[i][j]][bj2]=tu[bj2][p1[i][j]]=1,flag=1;
                else if(flag&&a[i][j]=='X')
                    flag=0;
                else if(flag&&a[i][j]!='X')
                    tu[p1[i][j]][bj2]=tu[bj2][p1[i][j]]=1;
        }
        m=bj1,n=bj2;
        printf("%d\n",hungary());
    }
    return 0;
}


版权声明:本文为博主原创文章,若转载请注明转载地址http://blog.csdn.net/martinue。

相关文章推荐

hdu1045—Fire Net(二分图最大匹配)

题目链接:传送门 Fire Net Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Othe...

HDU 1045(二分图)

Description Suppose that we have a square city with straight streets. A map of a city is a square b...

HDU 1045 Fire Net 二分图

题意:在给出的图中‘.’放置点。(同一行或者同一列的联通块中不能放置两个或以上黑点)思路:二分图,同一行的联通块缩成一个点,因为是等价的,称为二分图的X部,同理,同一列的联通块缩成一个点,称为二分图的...
  • NMfloat
  • NMfloat
  • 2015年12月09日 00:13
  • 249

hdu 1045 二分图

二分图简述 二分图,就是图中可以将点分成两个集合。相同集合的点没有连线,连线仅存在与集合之间的点。 二分图的匹配,就是二分图中相互没有公共点的线的集合,这些线就叫做匹配边,其端点就是匹配...

HDU 1045 Fire Net(二分图最大匹配)

题意:给出一张图,图中'X'表示wall,'.'表示空地,可以放置blockhouse ,同一条直线上只能有一个blockhouse,除非有wall隔开,问在给出的图中最多能放置多少个blockhou...

hdu1045 Fire Net(二分图最大匹配)

//hdu 1045 二分最大匹配 //以行和列为点,可以放的连边,中间有墙的看做不同的行或列。 //求二分图的最大匹配。同一行同一列只能放一个。即连某个点的边只能有一条。 //行和行,列和列之间互不...

HDU 1045 Fire Net 最大二分图匹配

Fire Net Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) Total...

hdu1045 暴力搜索,用二分图也可以做

http://acm.hdu.edu.cn/showproblem.php?pid=1045 Problem Description Suppose that we have a square ...

HDU 1045 Fire Net (二分图的最大匹配)

/* 构图:对于任意一行,如果该行里的格子彼此可到达(没有障碍物),则把他们归为同一个 点,纵向也是如此。 构造出来的横向点和纵向点,如果彼此覆盖,则连一条边,最后直接 求最大匹配。 ...
  • acbron
  • acbron
  • 2013年04月30日 21:46
  • 321

hdu 1045 贪心算法、DFS、枚举回溯&二分图

hdu 1045题意:图1 表示的是正方形的区域(黑色表示墙壁、白色位置可以放城堡。),城堡所在的那一行和列不能放其他的城堡。图二展示的是图1的情况在最多能放的城堡数。图3是可行但不是最多的情况,图4...
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:hdu1045(二分图)
举报原因:
原因补充:

(最多只允许输入30个字)