HDU Fire Net
来源:互联网 发布:网络公会是什么意思 编辑:程序博客网 时间:2024/05/17 05:54
Fire Net
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
#include<cstdio>
#include<algorithm>
#include<cstring>
#include<iostream>
using namespace std;
int map[5][5],n,a;
int check(int x,int y)
{ int i;
if(map[x][y])
return 0;
for(i=x-1;i>=1;i--)
if(map[i][y]==2)
break;
else if(map[i][y]==1)
return 0;
for(i=x+1;i<=n;i++)
if(map[i][y]==2)
break;
else if(map[i][y]==1)
return 0;
for(i=y-1;i>=1;i--)
if(map[x][i]==2)
break;
else if(map[x][i]==1)
return 0;
for(i=y+1;i<=n;i++)
if(map[x][i]==2)
break;
else if(map[x][i]==1)
return 0;
return 1;
}
void DFS(int m)
{
int i,j;
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
{
if(check(i,j))
{
map[i][j]=1;
DFS(m+1);
map[i][j]=0;
}
}
if(m>=a)
a=m;
}
int main()
{
int i,j;
char m;
while(scanf("%d",&n)&&n)
{ if(!n) break;
memset(map,0,sizeof(map));
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
{
cin>>m;
if(m=='X')
map[i][j]=2;
}
a=0;
DFS(0);
printf("%d\n",a);
}
}
- hdu 1045 Fire Net
- HDU 1045 Fire Net
- HDU 1045 Fire Net
- Hdu 1045 Fire Net
- HDU 1045 Fire Net
- hdu 1045 Fire Net
- HDU-1045-Fire Net
- hdu 1045 Fire Net
- hdu 1045 Fire Net
- HDU Fire Net
- HDU 1045 Fire Net
- hdu 1045 Fire Net
- HDU-1045 Fire Net
- HDU:1045 Fire Net
- HDU 1045 Fire Net
- Fire Net HDU
- HDU 1045 Fire Net
- hdu 1045 Fire Net
- C# 线程池中取消线程的三种方式
- 元素计算
- LeetCode 49 - Group Anagrams
- 《Java多线程编程核心技术》推荐
- hdu2612 Find a way(2次bfs)
- HDU Fire Net
- STL源码学习——空间配置器
- ACM_模板_中国剩余定理(互质与非互质)
- LINQ的预备知识
- uva10905连接n个数字,使得连成的数字最大
- 递归移位堆
- Linux日常运维管理命令
- OSWatcher Analyzer User Guide (文档 ID 461053.1)
- leetcode-Lowest Common Ancestor of a Binary Search Tree