hdoj 1045 Fire Net(DFS)
2015-08-04 21:13
351 查看
Fire Net
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 7916 Accepted Submission(s): 4508
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<stdio.h> #include<string.h> #include<algorithm> using namespace std; char map[5][5]; int maxx; int n; bool put(int row,int col ) { int i; for( i = row-1; i >= 0 ;i--)//判断列的可行性 { if(map[i][col] == 'o') return false; if(map[i][col] == 'X') break; } for( i = col - 1;i >= 0; i-- )//判断行的可行性 { if( map[row][i] == 'o') return false; if( map[row][i] == 'X') break; } return true; } void DFS( int b,int d) { int x,y; if( b == n*n ) { if( d > maxx) maxx = d; // maxx取得最优解。 return; } else { x = b / n; y = b % n; } if(map[x][y] == '.'&& put(x,y) )// 如果可放置碉堡 { map[x][y]='o'; //放一个碉堡 DFS( b+1, d+1 ); // 递归 到下一个单元 map[x][y]='.'; // 恢复 } DFS( b+1, d); // 此单元不放置碉堡 } int main() { while(scanf("%d",&n)!=EOF,n) { maxx = 0; for(int i =0 ; i < n ; i++) { scanf("%s", map[i] ); } DFS(0,0); printf("%d\n",maxx); } return 0; }
相关文章推荐
- dfs 小甜点 uva839与699
- iOS开发_Foundation框架
- poj 2299 Ultra-QuickSort (树状数组+离散化)
- MFC多线程各种线程用法
- NSData
- 根据数据动态改变Android列表背景颜色
- zoj sending
- HDOJ 1205 吃糖果
- Oracle 11g R2+RAC+ASM+redhat安装详解2
- nutch2.2.1抓取流程
- CS224d lecture 10札记
- 属性绑定:属性被绑定到一个表达式,这个属性就会被设置为自动更新,但是,分配静态值会移除绑定
- Linux小白成长记--linux入门准备
- java中包的必要性
- CentOS下Memcached安装和使用详解
- 工厂模式
- 【Linux】命令使用整理大全
- poj 题目分类
- 简单工厂设计模式
- 面试题总结10