hdu 1045 Fire Net
来源:互联网 发布:创新软件股票行情 编辑:程序博客网 时间:2024/05/20 18:44
回溯加搜索题。不多说了,看我的代码一定能明白其中的意思。
#include<stdio.h>
char s[4][4];
int max,n;
bool isok(int row,int col)
{
int i,j;
for(i=row-1;i>=0;i--)//up
{
if(s[i][col]=='X')
break;
else if(s[i][col]=='o')
return false;
}
for(i=row+1;i<n;i++)//down
{
if(s[i][col]=='X')
break;
else if(s[i][col]=='o')
return false;
}
for(j=col-1;j>=0;j--)//left
{
if(s[row][j]=='X')
break;
else if(s[row][j]=='o')
return false;
}
for(j=col+1;j<n;j++)//right
{
if(s[row][j]=='X')
break;
else if(s[row][j]=='o')
return false;
}
return true;
}
void digui(int num,int count)
{
int row,col;
row=num/n;col=num%n;
if(count>max)
max=count;
if(num>=n*n)
return ;
if(s[row][col]=='.' && isok(row,col))
{
s[row][col]='o';
digui(num+1,count+1);
s[row][col]='.';
}
digui(num+1,count);
}
int main()
{
int i,j;
while(scanf("%d",&n) && n)
{
max=0;
getchar();
for(i=0;i<n;i++)
{
for(j=0;j<n;j++)
scanf("%c",&s[i][j]);
getchar();
}
digui(0,0);
printf("%d/n",max);
}
return 0;
}
Fire Net Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) 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. 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
Total Submission(s): 1931 Accepted Submission(s): 1124
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.
- hdu 1045 Fire Net
- HDU 1045 Fire Net
- HDU 1045 Fire Net
- Hdu 1045 Fire Net
- HDU 1045 Fire Net
- hdu 1045 Fire Net
- HDU-1045-Fire Net
- hdu 1045 Fire Net
- hdu 1045 Fire Net
- HDU 1045 Fire Net
- hdu 1045 Fire Net
- HDU-1045 Fire Net
- HDU:1045 Fire Net
- HDU 1045 Fire Net
- HDU 1045 Fire Net
- hdu 1045 Fire Net
- hdu 1045 Fire Net
- hdu 1045 Fire Net
- Kmp算法
- 找到两个数组中的相同元素
- BizTalk 发布服务接口后访问该服务出现错误“Internal SOAP process failed”
- 俞敏洪在《赢在中国》中的经典点评语录
- 各大开源cms劲爆漏洞
- hdu 1045 Fire Net
- 怎样让弹出对话框居中显示程序代码
- 郁闷啊!
- 工作
- Altium Designer中关于铺铜的技巧
- 30句话是赢在中国节目中给出的对80后30个忠告:
- 小生谈云,你知道什么叫云计算吗?
- 四月单片机制作(心形音乐流水彩灯+定时器+时钟等)
- 几个小问题