hdu1045 Fire Net
2016-07-06 23:08
337 查看
Fire Net
Time Limit : 2000/1000ms (Java/Other) Memory Limit : 65536/32768K (Java/Other)Total Submission(s) : 65 Accepted Submission(s) : 39
Font: Times New Roman | Verdana | Georgia
Font Size: ← →
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.. .... 2 XX .X 3 .X. X.X .X. 3 ... .XX .XX 4 .... .... .... .... 0
Sample Output
5 1 5 2 4
Source
Zhejiang University Local Contest 2001#include <iostream> #include<algorithm> #include<cstdio> using namespace std; char mp[5][5]; int i,n,ans; int check(int x,int y) { for(int i=x-1;i>=0;i--) { if (mp[i][y]=='p') return 0; if (mp[i][y]=='X') break; } for(int j=y-1;j>=0;j--) { if (mp[x][j]=='p') return 0; if (mp[x][j]=='X') break; } return 1; } void dfs(int k,int num) { int x=k/n,y=k%n; if (k==n*n) { ans=max(num,ans); return; } if (mp[x][y]=='.') if (check(x,y)) { mp[x][y]='p'; dfs(k+1,num+1); mp[x][y]='.'; } dfs(k+1,num); return; } int main() { while(scanf("%d",&n),n) { for(i=0;i<n;i++) scanf("%s",&mp[i]); ans=0; dfs(0,0); printf("%d\n",ans); } return 0; }
相关文章推荐
- 练习四1011草儿。。
- kettle设计器连接oracle RAC时的连接字符串
- github中Repository上传代码
- 排序算法总结
- zepto和jquery的区别,zepto的不同使用8条小结 会JS就会zepto
- mysql 行转列(存储过程)
- 在Android Studio中使用Lambda
- centos7下使用yum安装mysql
- 全文检索Lucene(三)--中文分词与高亮显示
- 学习笔记-Java中的xml文件读取之SAX解析
- 2016sdau课程练习专题四 1002
- 7月6日所学内容
- BroadcastReceiver-有序广播
- 基于Retrofit+Okio+RxBus实现文件下载(带下载进度)
- 基于Retrofit+Okio+RxBus实现文件下载(带下载进度)
- Struts(六)
- Android开发笔记之notification消息推送 通知栏的实现
- C++ 中cin 输入流的多种函数用法
- UBI文件系统
- 浅谈卡尔曼滤波(Kalman Filter)(一)