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.
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<cstring>
#include<algorithm>
using namespace std;
const int Max=100;
int n;
int book[4][4];
char a[5][5];
struct f{
int x,y,step;
}c[16];
bool cmp(f p,f q){
return p.step<q.step;
}
int jud(int x,int y){
for(int i=x-1;i>=0;i--){ //上 //在改(*)这点时,i++,没改过来,n次Pr才发现,,头痛很久;
if(book[i][y]) {return 0;}
else if(a[i][y]=='X') break;
}
for(int i=x+1;i<n;i++) //下
if(book[i][y]) {return 0;}
else if(a[i][y]=='X') break;
for(int i=y-1;i>=0;i--) //左
if(book[x][i]) {return 0;}
else if(a[x][i]=='X') break;
for(int i=y+1;i<n;i++) //右
if(book[x][i]) {return 0;}
else if(a[x][i]=='X') break;
return 1;
}
int dfs(int x,int y){ (这函数是没递归,只是普通枚举。。)
int s=1; //感觉忽略点(x,y),令s=1,更有意义,逻辑清晰;
for(int i=x-1;i>=0;i--) //上 //ps:(*)逻辑错误曾0->i该i->0,这个错点并不是很头痛。
if(a[i][y]=='X') break;
else s++;
for(int i=x+1;i<n;i++) //下 //由于主函数中重复定义了n使n==0找了许久才发现这的n==0->重复定义
if(a[i][y]=='X') break;
else s++;
for(int i=y-1;i>=0;i--) //左
if(a[x][i]=='X') break;
else s++;
for(int i=y+1;i<n;i++) //右
if(a[x][i]=='X') break;
else s++;
return s;
}
int main(){
//int n; ps:曾在这又重复定义了n,找错时很头痛。
while(scanf("%d",&n)&&n){
memset(book,0,sizeof(book));
for(int i=0;i<n;i++)
scanf("%s",a[i]);
int k=-1;
for(int i=0;i<n;i++)
for(int j=0;j<n;j++)
{
c[++k].x=i;c[k].y=j;
if(a[i][j]=='X') {c[k].step=Max;}
else {c[k].step=dfs(i,j);}
}
sort(c,c+n*n,cmp);
int s=0;
for(int i=0;i<n*n;i++){
if(a[c[i].x][c[i].y]!='X'&&jud(c[i].x,c[i].y)) {
s++;book[c[i].x][c[i].y]=1;
}
}
printf("%d\n",s);
}
return 0;
}
//有些自以为码对的却会是致命的令头痛的问题;
//附队友搜索代码
#include<stdio.h>
#include<iostream>
#include<algorithm>
using namespace std;
char map[5][5];
int v[5][5],n,maxx,i,j;
bool judge(int x,int y){
for(int xx=x;xx<=n;xx++){
if(map[xx][y]=='X') break;
if(v[xx][y]) return false;
}for(int xx=x;xx>0;xx--){
if(map[xx][y]=='X') break;
if(v[xx][y]) return false;
}for(int yy=y;yy<=n;yy++){
if(map[x][yy]=='X') break;
if(v[x][yy]) return false;
}for(int yy=y;yy>0;yy--){
if(map[x][yy]=='X') break;
if(v[x][yy]) return false;
}
return true;
}
void dfs(int s){
if(s>maxx) maxx=s;
for(int i=1;i<=n;i++){
for(int j=1;j<=n;j++){
if(!v[i][j]&&map[i][j]!='X'&&judge(i,j)){
v[i][j]=1;
dfs(s+1);
v[i][j]=0;
}
}
}
}
int main(){
while(~scanf("%d",&n)&&n){
maxx=0;
for(i=1;i<=n;i++){
getchar();
for(j=1;j<=n;j++){
scanf("%c",&map[i][j]);
v[i][j]=0;
}
}
dfs(0);
printf("%d\n",maxx);
}
return 0;
}