hdu 1045 hdoj 1045
来源:互联网 发布:ubuntu系统能干什么 编辑:程序博客网 时间:2024/05/02 00:13
Fire Net
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 2702 Accepted Submission(s): 1545
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.
4.X......XX......2XX.X3.X.X.X.X.3....XX.XX4................0
51524
#include<iostream>
using namespace std;
char maze[4][4];
int n,cw,bestc;
bool judge(int x,int y){
bool flag=true;
for(int i=x;i<n&&maze[i][y]!='X';i++){
if(maze[i][y]=='#'){
flag=false;
break;
}
}
for(int i=x;i>=0&&maze[i][y]!='X';i--){
if(maze[i][y]=='#'){
flag=false;
break;
}
}
for(int i=y;i<n&&maze[y][i]!='X';i++){
if(maze[x][i]=='#'){
flag=false;
break;
}
}
for(int i=y;i>=0&&maze[x][i]!='X';i--){
if(maze[x][i]=='#'){
flag=false;
break;
}
}
return flag;
}
int backtrack(int x,int y){
if(x>=n){
if(cw>bestc) bestc=cw;
return 0;
}
if(y+1>=n){
if(maze[x][y]=='.'&&judge(x,y)){
maze[x][y]='#';
cw++;
backtrack(x+1,0);
maze[x][y]='.';
cw--;
}
backtrack(x+1,0);
}
if(y+1<n){
if(maze[x][y]=='.'&&judge(x,y)){
maze[x][y]='#';
cw++;
backtrack(x,y+1);
maze[x][y]='.';
cw--;
}
backtrack(x,y+1);
}
}
int main(){
while(cin>>n,n!=0){
cw=0,bestc=0;
for(int i=0;i<n;i++){
for(int j=0;j<n;j++){
cin>>maze[i][j];
}
}
backtrack(0,0);
cout<<bestc<<endl;
}
return 0;
}
- hdu 1045 hdoj 1045
- HDOJ HDU 1045 Fire Net
- HDOJ(HDU).1045 Fire Net (DFS)
- HDOJ 1045
- hdoj 1045 Climbing Worm
- HDOJ 1045 Fire Net
- HDOJ 1045 Fire Net
- hdoj 1045 Fire Net
- HDOJ 1045 Fire Net
- hdoj-1045-Fire Net
- hdoj-1045 Fire Net
- HDOJ HDU 3080
- HDOJ/HDU 1115
- HDOJ/HDU 2157
- HDOJ HDU Today
- HDU/HDOJ 1099 Lottery
- hdu 1871 hdoj 1871
- hdu 1008 hdoj 1008
- 提高雅思听力速度必须反复练耳朵别无捷径
- 单元测试实践的主要问题与解决(4)
- Android控件组合应用二
- 添加一个新的驱动到内核
- HTML5 Web Sockets与代理服务器交互
- hdu 1045 hdoj 1045
- http://blog.csdn.net/feixiaoxing 多线程 算法
- Android控件组合应用三
- 国外程序员推荐的免费编程书籍资源
- Service使用技巧,一些不为人知的功能 [移动平台 Android]
- C语言中系统函数在linux下的使用
- How tnsping work: Comparison of Oracle's tnsping to TCP/IP's ping [ID 146264.1]
- MFC文档应用程序实现文件拖拽到应用程序中显示
- 用C#读写ini配置文件完整范例