NYOJ 287 blockhouses

blockhouses

时间限制: 1000ms

内存限制: 128000KB

64位整型:      Java 类名:

类型: 

题目描述

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......2XX.X3.X.X.X.X.3....XX.XX4................0

样例输出

51524

/*分类：dfs来源：NYOJ blockhouses思路：给出一个地图，x表示墙，任何武器都不能穿过，.表示空地，在空地上可以建炮楼，每个炮楼都可以攻击到东西南北方向上的炮楼，前提是不能有墙挡着，在各个炮楼不能相互攻击的情况下，最多能建多少个炮楼。分析：题目类似于8皇后问题，我们直接在空地上填上炮楼，使之不与左边和上边的冲突即可。中间记录最大的值。We are giants.create by Lee_SD on 2017/4/20*/#include<stdio.h>#include<algorithm>#include<string.h>#include<iostream>using namespace std;char map[110][110];int n;int check(int r,int c){int flag=1;for(int i=r;i>=0;i--){if(map[i][c]=='X')break;if(map[i][c]=='b'){flag=0;break;}}for(int j=c;j>=0;j--){if(map[r][j]=='X') break;if(map[r][j]=='b'){flag=0;break;}}return flag;}int ans;void dfs(int pos,int sum){//一种x，y坐标的表达 int r=pos/n;int c=pos%n;if(pos==n*n){if(ans<sum)ans=sum;return;}if(map[r][c]=='.'){if(check(r,c)==1){map[r][c]='b';//放上后，做标记 dfs(pos+1,sum+1);map[r][c]='.';}}dfs(pos+1,sum);}int main(){while(cin>>n,n){memset(map,0,sizeof(map));for(int i=0;i<n;i++)cin>>map[i];ans=0;dfs(0,0);printf("%d\n",ans);}}


                                             
        0        0           
	
				
	
					   
NYOJ 287 blockhouses
	  	   
NYOJ 587 blockhouses 【DFS】
	  	   
NYOJ 587 blockhouses   【dfs】
	  	   
nyoj 587 blockhouses 【DFS】
	  	   
nyoj 587 blockhouses
	  	   
Fire Net HDU && NYOJ blockhouses
	  	   
nyoj 587 blockhouses（DFS）
	  	   
nyoj 587 blockhouses 【简单DFS】
	  	   
NYOJ  587   blockhouses   （DFS）
	  	   
blockhouses
	  	   
blockhouses
	  	   
Nyoj 587blockhouses  zoj 1002 Fire Net
	  	   
hdu 1045 fire net &nyoj  587 blockhouses（dfs！）
	  	   
NYOJ 题目587 blockhouses（二分图最大匹配）
	  	   
hdu--1045--Fire Net,NYOJ--587--dfs--blockhouses
	  	   
NYOJ587-blockhouses(DFS)
	  	   
NYOJ587 blockhouses【DFS】
	  	   
南阳理工ACM 587 blockhouses
	     		  
	  	   
phpmyadmin的安装
	  	   
手机分辨率基础知识
	  	   
HashMap,LinkedHashMap,TreeMap的区别
	  	   
Android Settings 快速搜索
	  	   
Windows下Generate CSR
	  	   
NYOJ 287 blockhouses
	  	   
oracle sql优化
	  	   
关于缓存
	  	   
【Java学习20170420】JSP基础
	  	   
文章标题
	  	   
搭建SSM
	  	   
web前端面试
	  	   
row_number() over(partition by
	  	   
javaScript中的浅拷贝和深拷贝