blockhouses
来源:互联网 发布:js调用手机相册插件 编辑:程序博客网 时间:2024/05/01 03:57
blockhouses
时间限制:1000 ms | 内存限制:65535 KB
难度:3
- 描述
- 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.- 输入
- 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.
- 输出
- For each test case, output one line containing the maximum number of blockhouses that can be placed in the city in a legal configuration.
- 样例输入
4.X......XX......2XX.X3.X.X.X.X.3....XX.XX4................0
- 样例输出
51524
#include<stdio.h>#include<algorithm>#include<math.h>#include<iostream>#include<string.h>using namespace std;char a[1000][1000];int n;int maxn;int sum;int we(int b,int c){ for(int i=b-1; i>=0; i--)//倒着查,否则会出现这种情况:你先找到炮楼就返回0了,但是炮楼下面可能会有墙堵着,本应该返回1但是你返回0了,这时就会出错。所以要从下面开始找起。 { if(a[i][c]=='#') { return 0; } if(a[i][c]=='X') { break; } } for(int i=c-1; i>=0; i--) { if(a[b][i]=='#') { return 0; } if(a[b][i]=='X') { break; } } return 1;}void dfs(int ha,int haha){ if(ha==n) { maxn=max(sum,maxn); return; } else { for(int i=haha;i<n;i++) { if(a[ha][i]=='.') { if(we(ha,i)) { a[ha][i]='#'; sum++; dfs(ha,i); a[ha][i]='.'; sum--; } else { dfs(ha+1,0);//从下一行找 } } if(a[ha][i]=='#') { dfs(ha+1,0); } if(a[ha][i]=='X') { dfs(ha+1,0); } }}}int main(){ while(scanf("%d",&n)!=-1) { for(int i=0; i<n; i++) { scanf("%s",a[i]); } if(n==0) break; maxn=0; sum=0; dfs(0,0); printf("%d\n",maxn); }}
0 0
- blockhouses
- blockhouses
- NYOJ587-blockhouses(DFS)
- NYOJ 587 blockhouses 【DFS】
- NYOJ 587 blockhouses 【dfs】
- NYOJ587 blockhouses【DFS】
- nyoj 587 blockhouses 【DFS】
- NYOJ 287 blockhouses
- nyoj 587 blockhouses
- 南阳理工ACM 587 blockhouses
- Fire Net HDU && NYOJ blockhouses
- nyoj 587 blockhouses(DFS)
- nyoj 587 blockhouses 【简单DFS】
- NYOJ 587 blockhouses (DFS)
- Nyoj 587blockhouses zoj 1002 Fire Net
- hdu 1045 fire net &nyoj 587 blockhouses(dfs!)
- NYOJ 题目587 blockhouses(二分图最大匹配)
- hdu--1045--Fire Net,NYOJ--587--dfs--blockhouses
- 最长上升子序列
- Ajax请求下载文件
- unity5 测试导出场景和光照贴图丢失的问题
- (三)5阻塞型IO实现
- 输入子系统 input_match_device 匹配过程剖析
- blockhouses
- Activity过度动画应用
- 下拉菜单的实现,纯CSS实现下拉菜单 与 使用JS实现下拉菜单
- 小工具
- java方法提取身份证信息中的生日
- 有关于C指针的一些知识点(又名C指针编程之道读书笔记)
- 使用xshell一类工具时可以使用的vi命令
- (三)6 poll和sellct
- C++队列应用