點擊打開鏈接

Fire Net

Time Limit: 2000/1000 MS (Java/Others)????Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 14238????Accepted Submission(s): 8616

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

Source

Zhejiang University Local Contest 2001

Recommend

We have carefully selected several similar problems for you:??1016?1051?1050?1312?1067+

題意：

給一個二維地圖，“.”表示可以放置一個炮臺，"X"表示墻壁，炮臺不能放在同行同列，除非中間有墻壁

求最多可以放多少個炮臺？

題解：

#include<bits/stdc++.h> using namespace std; int n; int mp[5][5];//-1表示墻，0表示可行，1表示炮臺 struct point {int x,y; }; int dic[4][2]={{-1,0},{1,0},{0,1},{0,-1}}; point p[20]; int cnt,ans; int judge(int x,int y) {if(x<0||y<0||x>=n||y>=n)return -1;//墻壁return mp[x][y]; }int check(int k) {int flag=0;int x,y;for(int i=0;i<4;i++){if(flag) break;x=p[k].x+dic[i][0];y=p[k].y+dic[i][1];while(x>=0&&y>=0&&x<n&&y<n){int t=judge(x,y);if(t==-1) break;if(t==1){//找到此行或此列已經有炮臺即退出flag=1; break;}x+=dic[i][0];y+=dic[i][1];}}return flag; } void dfs(int cur,int turn) {if(turn>ans) ans=turn;if(cur==cnt) return;dfs(cur+1,turn);if(!check(cur)){mp[p[cur].x][p[cur].y]=1;dfs(cur+1,turn+1);mp[p[cur].x][p[cur].y]=0;//回溯} } int main() {char s[10];while(scanf("%d",&n)&&n){cnt=0;ans=0;for(int i=0;i<n;i++){scanf("%s",s);for(int j=0;j<n;j++){if(s[j]=='.'){mp[i][j]=0;//可以放置p[cnt].x=i;p[cnt].y=j;cnt++;}else mp[i][j]=-1;}}dfs(0,0);printf("%d\n",ans);}return 0; }

?

總結

以上是生活随笔為你收集整理的HDU1045 Fire Net 递归回溯的全部內容，希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網站內容還不錯，歡迎將生活随笔推薦給好友。