ZOJ 1002 FZU 1098 HDU 1045 Fire Net
2015-07-15 17:00
459 查看
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.
[align=left]Input[/align]
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.
[align=left]Output[/align]
For each test case, output one line containing the maximum number of blockhouses that can be placed in the city in a legal configuration.
[align=left]Sample Input[/align]
[align=left]Sample Output[/align]
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.
[align=left]Input[/align]
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.
[align=left]Output[/align]
For each test case, output one line containing the maximum number of blockhouses that can be placed in the city in a legal configuration.
[align=left]Sample Input[/align]
4 .X.. .... XX.. .... 2 XX .X 3 .X. X.X .X. 3 ... .XX .XX 4 .... .... .... .... 0
[align=left]Sample Output[/align]
5 1 5 2 4 拿了别人的思路,写了一遍#include <iostream> using namespace std; char map[5][5]; int Max,n; int IsSet(int row,int col) { int i; for(i=col-1;i>=0;i--) { if(map[row][i]=='0') return 0; if(map[row][i]=='X') break; } for(i=row-1;i>=0;i--) { if(map[i][col]=='0') return 0; if(map[i][col]=='X') break; } return 1; } void DFS(int k,int num) { int x,y; if(k==n*n) { if(num>Max) { Max=num; return; } } else { x=k/n; y=k%n; if((map[x][y]=='.')&&(IsSet(x,y)==1)) { map[x][y]='0'; DFS(k+1,num+1); map[x][y]='.'; } DFS(k+1,num); } } int main() { int i,j; while(cin>>n&&n) { for(i=0;i<n;i++) for(j=0;j<n;j++) cin>>map[i][j]; Max=0; DFS(0,0); cout<<Max<<endl; } return 33; }
相关文章推荐
- 【sqlserver】记录
- 分享:面相对象的建模(封装业务层)
- dll劫持技术
- redis学习-5种数据类型和相关命令
- 联合体的巧用
- 利用反射机制访问类中的私有方法
- 多个线程之间共享数据的方式(卖票问题,存取款问题)
- C#实现按数据库邮件列表发送邮件的方法
- 友盟集成
- CSS中使用Flexbox来达到居中效果的实例
- Log4j日志级别
- 学习c++的五十条忠告
- iOS中 imageNamed方法 很多图片占用大量内存问题
- MySQL Cluster Windows 安装
- asp.net调用JAVA的webservice时注意
- OpenHCI - 4.2 Endpoint Descriptor
- eclipse clean up与formatter的区别
- jquery与Dom元素的互换
- linux vim常用快捷键
- kafka安装和测试