Fire Net
Time Limit: 2000/1000 MS
(Java/Others) Memory Limit: 65536/32768 K
(Java/Others)
Total Submission(s): 5863 Accepted
Submission(s): 3280
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.
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
Recommend
DFS深搜经典题。
暴力穷举即可，数据规模大的话据说可以用二分匹配，另外这道题也可以用贪心来做。
代码：
1 #include <iostream>
2
3 using namespace std;
4 char a[5][5];
5 int cnt,n;
6 bool judge(int x,int y) //判断这一步可不可以走
7 {
8 if(a[x][y]==‘X‘)
9 return 1;
10 if(a[x][y]==‘*‘)
11 return 1;
12 int i;
13 //判断这一行上有无碉堡
14 for(i=y;i>=1;i--){
15 if(a[x][i]==‘*‘)
16 return true;
17 if(a[x][i]==‘X‘)
18 break;
19 }
20 for(i=y;i<=n;i++){
21 if(a[x][i]==‘*‘)
22 return true;
23 if(a[x][i]==‘X‘)
24 break;
25 }
26 //判断这一列上有无碉堡
27 for(i=x;i>=1;i--){
28 if(a[i][y]==‘*‘)
29 return 1;
30 if(a[i][y]==‘X‘)
31 break;
32 }
33 for(i=x;i<=4;i++){
34 if(a[i][y]==‘*‘)
35 return 1;
36 if(a[i][y]==‘X‘)
37 break;
38 }
39 //可以走
40 return 0;
41 }
42 void dfs(int cx,int cy,int cn)
43 {
44 if(cn>cnt) cnt=cn; //记录最大值
45 int x=-1,y=-1;
46 int i,j;
47 for(i=cx;i<=n;i++) //选择这一步的位置
48 for(j=1;j<=n;j++){
49 if(i==cx && j<=cy)
50 continue;
51 if(judge(i,j))
52 continue;
53 x=i;y=j;
54 a[x][y] = ‘*‘;
55 dfs(x,y,cn+1);
56 a[x][y] = ‘.‘;
57 }
58 if(x==-1 && y==-1)
59 return ;
60 }
61 int main()
62 {
63 while(cin>>n){
64 if(n==0) break;
65 int i,j;
66 for(i=1;i<=n;i++) //输入地图
67 for(j=1;j<=n;j++)
68 cin>>a[i][j];
69 cnt = 0;
70 dfs(1,0,0); //深搜
71 cout<<cnt<<endl;
72 }
73 return 0;
74 }
Freecode : www.cnblogs.com/yym2013