nyoj 587 blockhouses
来源:互联网 发布:淘宝网太阳眼镜 编辑:程序博客网 时间:2024/05/22 04:00
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
这题和8皇后题非常的相似,代码解析见注释
#include<iostream>#include<cstdio>#include<cstring>using namespace std;char a[110][110];///存图int ans;///结果int n;///n行n列bool isok(int x,int y)///判断能否建炮塔,放的时候是往下右,所以只用向左和上搜索就可以了{ bool z=true; for(int i=x;i>=0;i--){ if(a[i][y]=='#'){ z=false; break; } if(a[i][y]=='X') break; } for(int i=y;i>=0;i--){ if(a[x][i]=='#'){ z=false; break; } if(a[x][i]=='X') break; } return z;}void dfs(int pos,int cur){ int x=pos/n;///这里为了减少传入的参数所以把坐标用pos来代表 int y=pos%n; if(pos==n*n){ ans=ans<cur?cur:ans; return ; } if(a[x][y]=='.'&&isok(x,y)==1){ a[x][y]='#';///用#来标记所建造的炮塔 dfs(pos+1,cur+1); a[x][y]='.';///当递归返回后拆除炮塔 } dfs(pos+1,cur);}int main(){ while(cin>>n,n){ memset(a,0,sizeof(a)); for(int i=0;i<n;i++) scanf("%s",a[i]); ans=0; dfs(0,0); printf("%d\n",ans); } return 0;}
阅读全文
1 0
- NYOJ 587 blockhouses 【DFS】
- NYOJ 587 blockhouses 【dfs】
- nyoj 587 blockhouses 【DFS】
- nyoj 587 blockhouses
- nyoj 587 blockhouses(DFS)
- nyoj 587 blockhouses 【简单DFS】
- NYOJ 587 blockhouses (DFS)
- Nyoj 587blockhouses zoj 1002 Fire Net
- NYOJ 287 blockhouses
- hdu 1045 fire net &nyoj 587 blockhouses(dfs!)
- NYOJ 题目587 blockhouses(二分图最大匹配)
- hdu--1045--Fire Net,NYOJ--587--dfs--blockhouses
- Fire Net HDU && NYOJ blockhouses
- blockhouses
- blockhouses
- 南阳理工ACM 587 blockhouses
- NYOJ587-blockhouses(DFS)
- NYOJ587 blockhouses【DFS】
- PHP入门基础
- 1 Docker tutorial
- Git修改远程仓库地址
- Maven简单安装与集成MyEclipse
- 计蒜客 跳跃游戏(dp)
- nyoj 587 blockhouses
- Mina框架构建一个HelloWorld
- 正则表达式之过滤html标签
- mybatis-plus自动生成代码不覆盖生成,若存在就不生成,多模块就生成到相应的模块
- iOS -NSUserDefault详解
- 基于SSM框架的人事系统搭建(一)
- spring学习之---两种后处理器
- Day3
- 推荐一款提供web界面的分布式crontab管理软件