HDU 1045 Fire Net
来源:互联网 发布:联合国统计署数据库 编辑:程序博客网 时间:2024/05/22 09:42
Fire Net
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......2XX.X3.X.X.X.X.3....XX.XX4................0
Sample Output
51524
普通深搜加上判断周围是否有已经处理过的点。
#include<stdio.h>#include<string.h>#include<algorithm>using namespace std;char c[4][4];int a[4][4];bool m[4][4];int M,e,n;int dfs(int sum,int I){ int i,j,k; for(i=I; i<n; i++) { for(j=0; j<n; j++) { e=0; if(a[i][j]==0&&m[i][j]==0)//整个就是判断周围有没有已有的炮台,已有则改变e的值 { for(k=1; k<n; k++) { if(i+k<n) if(a[i+k][j]==2) { e=1; break; } else if(a[i+k][j]==1) break; } for(k=1; k<n; k++) { if(i-k>=0&&e==0) if(a[i-k][j]==2) { e=1; break; } else if(a[i-k][j]==1) break; } for(k=1; k<n; k++) { if(j+k<n&&e==0) if(a[i][j+k]==2) { e=1; break; } else if(a[i][j+k]==1) break; } for(k=1; k<n; k++) { if(j-k>=0&&e==0) if(a[i][j-k]==2) { e=1; break; } else if(a[i][j-k]==1) break; } if(a[i][j]==0&&m[i][j]==0&&e==0)//这点可落,递归找下一点 { a[i][j]=2; m[i][j]=1; sum++; M=max(sum,dfs(sum,i)); sum--; a[i][j]=0; m[i][j]=0; } } } } return M;}int main(){ int i,j; while(~scanf("%d",&n)&&n) { getchar(); for(i=0; i<n; i++) { for(j=0; j<n; j++) { scanf("%c",&c[i][j]); if(c[i][j]=='.') a[i][j]=0; else a[i][j]=1; } getchar(); } M=0; printf("%d\n",dfs(0,0)); } return 0;}
1 0
- hdu 1045 Fire Net
- HDU 1045 Fire Net
- HDU 1045 Fire Net
- Hdu 1045 Fire Net
- HDU 1045 Fire Net
- hdu 1045 Fire Net
- HDU-1045-Fire Net
- hdu 1045 Fire Net
- hdu 1045 Fire Net
- HDU 1045 Fire Net
- hdu 1045 Fire Net
- HDU-1045 Fire Net
- HDU:1045 Fire Net
- HDU 1045 Fire Net
- HDU 1045 Fire Net
- hdu 1045 Fire Net
- hdu 1045 Fire Net
- hdu 1045 Fire Net
- 让Android程序获得系统的权限,实现关机重启,静默安装等功能
- DBUtils+C3P0封装
- 为什么写博客
- geetest极验验证码使用
- 我
- HDU 1045 Fire Net
- 一个故事告诉你比特币的原理及运作机制_系统架构
- PDO总结
- 图吧地图夜间导航SDK接口应用案例
- leetcode 42. Trapping Rain Water
- 修改Tomcat服务的默认端口号
- DOM优化-笔记
- hibernate缓存机制详细分析
- ButterKnife替代findViewById