hdu 1045 解题报告

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. 

4
.X..
....
....
XX..
2
XX
X.X
.X
3
.X.
.X.
.XX
3
...
.XX
4
....
....
....
....
0

5
1
2
5
4

题目大意：有一个n行n列的网格，可以往里面填炮台，炮台的炮可以沿着行或者列发射，但是不可以穿过墙。现在问最多可以放多少个炮台，使得它们不会打到对方。

思路：一开始的思路不对，比较混乱，想着从上往下搜索整个网格，能放就放上，并做标记，遇到墙就清除本行本列的标记。但是这样很难实现，递归的边界不明确，而且有个问题就是只能做到从第一个开始搜索直到结束，不能返回上一次有分叉的地方。

后来参考了别人的代码（附上网址：http://www.acmerblog.com/hdu-1045-fire-net-1308.html），感觉思路清晰多了。。。用一个函数来判断某个格点是否可以放炮台，即先判断一下它的左边，如果遇到的第一个是炮台，直接返回0，若遇到的第一个是墙，就退出循环，上方同理。然后再递归，具体见代码。

#include <iostream>
#include <cstdio>
#include <cstring>
using namespace std;

int visc[5],n,maxn;
char grid[5][5];

int judge(int k)//判断该格点是否可以放炮台
{
    int r=k/n,c=k%n;
    int i;
    for(i=c;i>=0;i--)
    {
        if(grid[r][i]=='X')break;
        else if(grid[r][i]=='@')return 0;
    }
    for(i=r;i>=0;i--)
    {
        if(grid[i][c]=='X')break;
        else if(grid[i][c]=='@')return 0;
    }
    return 1;
}

void dfs(int k,int cnt)
{
    if(k==n*n)
    {
        if(maxn<cnt)maxn=cnt;
        return;
    }
    if(grid[k/n][k%n]=='.'&&judge(k))
    {
        grid[k/n][k%n]='@';
        dfs(k+1,cnt+1);
        grid[k/n][k%n]='.';
    }
    dfs(k+1,cnt);
}

int main()
{
    while(scanf("%d",&n) != EOF)
    {
        if(n==0)break;
        for(int i=0;i<n;i++)
        {
            scanf("%s",grid[i]);
        }
        maxn=-1;
        dfs(0,0);
        printf("%d\n",maxn);
    }
    return 0;
}

这题做完之后还有一个地方需要总结，就是表示一个点的方式可以只用一个数，如这题中的k，比如说一个点的坐标是（x,y）,k=x*n+y,n为每行的列数。要恢复成原来的坐标就是x=k/n,y=k%n就可以了。这题似乎还有一种做法。。。以后再更新好了