fuzhuo---109 8Fire Net
来源:互联网 发布:财务部swot矩阵分析表 编辑:程序博客网 时间:2024/06/03 17:34
Problem Description
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 islegal 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 integern 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
Sample Output
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
#define N 10
char map[N][N];
int n,ans;
int check(int r, int c)
{
int flag=1,i;
for(i=r-1; i>=0; i--)
{
if(map[i][c]=='X') break;
if(map[i][c]=='b')
{
flag=0;
break;
}
}
for(i=c-1; i>=0; i--)
{
if(map[r][i]=='X') break;
if(map[r][i]=='b')
{
flag=0;
break;
}
}
return flag;
}
void dfs(int pos,int sum)
{
int r=pos/n,c=pos%n;
if(pos==n*n)
{
if(sum>ans) ans=sum;
return;
}
if(map[r][c]=='.')
{
if(check(r,c))
{
map[r][c]='b';
dfs(pos+1,sum+1);
map[r][c]='.';
}
}
dfs(pos+1,sum);
}
int main()
{
int i;
while(scanf("%d",&n),n)
{
memset(map,0,sizeof(map));
ans=0;
for(i=0; i<n; i++)
scanf("%s",map[i]);
dfs(0,0);
printf("%d\n",ans);
}
return 0;
}
- fuzhuo---109 8Fire Net
- fuzhuo----
- Fire Net
- Fire Net
- Fire Net
- Fire Net
- Fire Net
- Fire Net
- Fire Net
- Fire Net
- Fire Net
- Fire Net
- Fire Net
- Fire Net
- Fire Net
- Fire Net
- fire net
- Fire Net
- Html5-快捷键总览(window)
- 网络编程之新闻案例
- 类加载器
- 利用% /求输入的数字串的每一位上的数
- [Emacs] Spacemacs cheatsheet
- fuzhuo---109 8Fire Net
- 列表选择
- X南移动更换SUN E6900 系统板步骤
- 山东大学项目实训——5月28日
- java基础之File(具体案例)
- java中的Timer用法(二) 使用举例
- 【C语言】通讯录:动态开辟内存版和文件版本
- CF 811C (DP)
- Android View刷新原理Invalidate()和PostInvalidate()源码分析