大一暑假第二周下 二分图 F - Fire Net

F - Fire Net

二分图最难的就是建立两个图的过程，通过本题就可以掌握大体的思路：
题目：
题目链接
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.

输入：
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.

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

样例：
输入：
4
.X…
…
XX…
…
2
XX
.X
3
.X.
X.X
.X.
3
…
.XX
.XX
4
…
…
…
…
0
输出：
5
1
5
2
4
————————————————————————————————————————
题意：
题目链接
和这道题很像，但又不完全像。
给你一个n*n的地图，地图上要放一些炮台，这些炮台可以打到他这一行或他这一列的所有炮台；同时，在一些位置上也会有坚不可摧的墙壁，并且炮台打不穿这些墙壁。请问，在这样的前提条件下，最多能放几个炮台。

思路：
第一次看题感觉这不和象棋问题一模一样吗，然而再一看，发现本题中的墙壁是象棋问题所没有的；本题中的墙壁可以使一行或者一列的区域分割成多个区域（墙壁才是本题的精髓所在）。
接下来思路就清晰了：先把墙壁划分后的所有区域都找出来（根据二分图原理，肯定要按照行和列寻找两遍），然后编号，这样两个图不就建立完成了，接下来就是二分匹配解决问题了，交给计算机吧。

——————————————————————————————————————————
代码：

#include<stdio.h>
#include<math.h>
#include<iostream>
#include<string.h>
#include<string>
#include<vector>
#include<map>
#include<algorithm>
#define inf 99999999
using namespace std;
/*
大体思路：把每一个空白位置标序号；分别按照行和列来
遍历两遍，这样就成功的转化成一道二分匹配问题。
*/
int f[20],match[10],book[20];//老三样
int n,x,y;
int h[10][10],g[10][10];//h为行，g为列
int r[20][20];//建立关系，两者之间是否可以匹配
char e[20][20];

int dfs(int a)
{
    int i,j,k;
    for(i=0;i<=x;i++)
    {
        if(book[i]==0&&r[a][i]==1)
        {
            book[i]=1;
            if(f[i]==0||dfs(f[i]))
            {
                f[i]=a;
                return 1;
            }
        }
    }
    return 0;

}
int main()
{
    int i,j,sum;
    while(cin>>n)
    {
        if(n==0)
            break;
        for(i=0;i<n;i++)
        {
            scanf("%s",e[i]);
        }
        sum=0;
        y=0;
        for(i=0;i<n;i++)//遍历行
        {
            y++;
            for(j=0;j<n;j++)
            {
                if(e[i][j]=='.')
                    h[i][j]=y;
                else
                    y++;
            }
        }
        x=0;
        for(j=0;j<n;j++)//遍历列
        {
            x++;
            for(i=0;i<n;i++)
            {
                if(e[i][j]=='.')
                    g[i][j]=x;
                else
                    x++;

            }
        }
        memset(r,0,sizeof(r));
        for(i=0;i<n;i++)//初始化匹配关系
        {
            for(j=0;j<n;j++)
            {
                if(e[i][j]=='.')
                {
                    r[h[i][j]][g[i][j]]=1;
                }
            }
        }
        memset(f,0,sizeof(f));

        for(i=0;i<=y;i++)//接下来就是二分匹配了
        {
            memset(book,0,sizeof(book));
            if(dfs(i))
                sum++;
        }
        cout<<sum<<endl;
    }
    return 0;
}