HDU-1045 Fire Net(DFS+回溯)
来源:互联网 发布:模拟教学软件 编辑:程序博客网 时间:2024/05/18 03:33
HDU-1045 Fire Net(DFS+回溯)
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 9878 Accepted Submission(s): 5737
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......2XX.X3.X.X.X.X.3....XX.XX4................0
Sample Output
51524
题意:求放n*n的图中最多可放点的个数,’.’是可摆的,’#’是墙不可摆的同时起到可隔开两点的作用(点和点不能摆在同列同行)。
#include <algorithm>#include <iostream>#include <cstring>#include <cstdio>using namespace std;#define eps 1e-6#define pi 3.14159265359typedef long long LL;const int maxn = 10;int n, m, ma;char a[maxn][maxn];/*求放n*n的图中最多可放的个数*/int check(int r,int c){ //检查 r-1 * c-1图 for(int i=c-1; i>=0; i--){//第r行 if(a[r][i] == '0') return 0; if(a[r][i] == 'X') break; } for(int i=r-1; i>=0; i--){//第c列 if(a[i][c] == '0') return 0; if(a[i][c] == 'X') break; } return 1;}void dfs(int cur,int curM){ int r,c; if(cur == n*n ){ if(curM>ma){ ma = curM; return; } }else{ r = cur/n; c = cur%n; if((a[r][c] == '.') && (check(r,c)==1)){ a[r][c] = '0'; dfs(cur+1,curM+1); a[r][c] = '.'; } dfs(cur+1,curM); }}int main(){ while(cin>>n && n){ for(int i=0; i<n; i++){ for(int j=0; j<n; j++){ cin>>a[i][j]; } } ma = 0; dfs(0,0); cout<<ma<<endl; } return 0;}/*3X.XX.XXXX*/
- 【DFS 回溯】HDU 1045 Fire Net
- HDU 1045 Fire Net(DFS回溯)
- hdu 1045 Fire Net(DFS+回溯)
- HDU-1045 Fire Net(DFS+回溯)
- -----暴力dfs+回溯 hdu 1045-Fire Net
- HDOJ Fire Net 1045【DFS+回溯】
- hdu 1045 Fire Net-dfs
- hdu 1045 Fire Net dfs
- 【DFS】hdu 1045 Fire Net
- hdu 1045 Fire Net(dfs)
- HDU 1045 Fire Net【DFS】
- hdu 1045 Fire Net (dfs)
- HDU--1045--Fire Net--DFS
- dfs hdu 1045 Fire Net
- hdu 1045 Fire Net【dfs】
- hdu 1045 Fire Net(dfs)
- HDU 1045 Fire Net dfs
- hdu-1045 Fire Net(DFS)
- 2016计蒜之道 复赛 A. 百度地图的实时路况(cdq分治+floyd)
- android实现通过浏览器点击链接打开本地应用(APP)并拿到浏览器传递的数据
- HDU3001 Travelling
- NYOJ-大数阶乘
- linux下TCP连接
- HDU-1045 Fire Net(DFS+回溯)
- Linux客户端与服务器相互实现聊天功能
- displaytag的使用方法(用于数据表格的显示和功能控制) tabledecorator实现链接按钮
- android之surfaceView详解--自定义surfaceView和用于视频surfaceview
- context-param与init-param的区别与作用
- Es6初尝试
- Python基本数据类型
- YSlow:Add Expires headers - 为 Apache 服务器添加“文件过期时间头信息”
- 程序员面试宝典--8.3循环和数组 zigzag编码