hdoj-1045 Fire Net
来源:互联网 发布:网络大神作家经典作品 编辑:程序博客网 时间:2024/05/16 07:49
Fire Net
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 12774 Accepted Submission(s): 7746
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
题目链接
题意:题意很简单,输入n,给一个n*n的图,x表示墙,现在在图中放城堡,城堡可以向四个方向发射子弹,子弹不能穿透墙,现要求城堡之间不能互相打中,问图中可以放多少城堡。
#include<iostream>#include<stdio.h>#include<string.h>using namespace std;char map[110][110];int n,ans;int check(int r,int c){ int flag=1,i; for(i=r;i>=0;i--) { if(map[i][c]=='X') break; if(map[i][c]=='b') { flag=0; break; } } for(i=c;i>=0;i--) { if(map[r][i]=='X') break; if(map[r][i]=='b') { flag=0; break; } } return flag;}void dfs(int pos,int sum){ int r=pos/n,c=pos%n; if(pos==n*n) { if(sum>ans) ans=sum; return; } if(map[r][c]=='.') { if(check(r,c)==1) { map[r][c]='b';//b 表示建立一个blockhouse dfs(pos+1,sum+1); map[r][c]='.'; } } dfs(pos+1,sum);}int main(){ int i; while(scanf("%d",&n)&&n!=0) { memset(map,0,sizeof(map)); for(i=0,ans=0;i<n;i++) { scanf("%s",map[i]); } dfs(0,0); printf("%d\n",ans); } return 0;}
阅读全文
1 0
- HDOJ 1045 Fire Net
- HDOJ 1045 Fire Net
- hdoj 1045 Fire Net
- HDOJ 1045 Fire Net
- hdoj-1045-Fire Net
- hdoj-1045 Fire Net
- ACM HDOJ 1045 (Fire Net)
- hdoj 1045 Fire Net 【DFS】
- 【HDOJ 1045】Fire Net--dfs
- hdoj 1045 Fire Net(DFS)
- 【ACM】HDOJ 1045 Fire Net
- hdoj 1045 Fire Net 【dfs】
- hdoj 1045 Fire Net (dfs)
- HDOJ HDU 1045 Fire Net
- HDOJ 题目1045 Fire Net(dfs)
- 【HDOJ 1045】Fire Net--二分图
- HDOJ Fire Net 1045【DFS+回溯】
- hdoj--1045--Fire Net(二分图)
- 区间平均值(逆序对)
- ImportError: cannot import name 'downsample'
- Java中toString方法和String.valueOf方法使用
- 机器学习算法-聚类(一、性能度量和距离计算)
- 【译文】构建一个图书推荐系统 – 基础知识、knn算法和矩阵分解
- hdoj-1045 Fire Net
- Java知识--基本数据类型
- JS版]基于百度地图的 Overlay 扩展,仿Q房网实现自定义覆盖物
- Spring4中的@Value的使用(学习笔记)
- Codeforces 1A. Theatre Square
- softmax层的实现
- 课后习题page100.pp.3.2
- 【51nod】1050 循环数组最大子段和
- [洛谷 2822]组合数问题---二项式定理+前缀和