Red and Black
来源:互联网 发布:知乎 一二级市场套利 编辑:程序博客网 时间:2024/06/09 19:47
Problem Description
There is a rectangular room, covered with square tiles. Each tile is colored either red or black. A man is standing on a black tile. From a tile, he can move to one of four adjacent tiles. But he can't move on red tiles, he can move only on black tiles.
Write a program to count the number of black tiles which he can reach by repeating the moves described above.
Write a program to count the number of black tiles which he can reach by repeating the moves described above.
Input
The input consists of multiple data sets. A data set starts with a line containing two positive integers W and H; W and H are the numbers of tiles in the x- and y- directions, respectively. W and H are not more than 20.
There are H more lines in the data set, each of which includes W characters. Each character represents the color of a tile as follows.
'.' - a black tile
'#' - a red tile
'@' - a man on a black tile(appears exactly once in a data set)
There are H more lines in the data set, each of which includes W characters. Each character represents the color of a tile as follows.
'.' - a black tile
'#' - a red tile
'@' - a man on a black tile(appears exactly once in a data set)
Output
For each data set, your program should output a line which contains the number of tiles he can reach from the initial tile (including itself).
Sample Input
6 9....#......#..............................#@...#.#..#.11 9.#..........#.#######..#.#.....#..#.#.###.#..#.#..@#.#..#.#####.#..#.......#..#########............11 6..#..#..#....#..#..#....#..#..###..#..#..#@...#..#..#....#..#..#..7 7..#.#....#.#..###.###...@...###.###..#.#....#.#..0 0
Sample Output
4559613
分析:此题是简单的搜索题,本人用的是深搜dfs
代码:
#include<stdio.h>
#include<string.h>
char a[130][130];
int vis[130][130];
int n,m,count;
//int x[4]={1,-1,0,0};
//int y[4]={0,0,-1,1};
void dfs(int r,int t,int s)
{
int i;
if(r>=m||r<0||t>=n||t<0||vis[r][t])
return ;
if(a[r][t]=='#')
return ;
++count;
vis[r][t]=1;
dfs(r,t+1,s);
dfs(r-1,t,s);
dfs(r,t-1,s);
dfs(r+1,t,s);
//vis[r][t]=0;
// for( i=0;i<4;i++)
// {
// dfs(x[i]+r,y[i]+t,s);
// }
}
int main(){
int i,j,k,r,t;
while(~scanf("%d%d",&n,&m))
{
for(i=0;i<m;i++)
scanf("%s",a[i]);
memset(vis,0,sizeof(vis));
for(i=0;i<m;i++)
for(j=0;j<n;j++)
if(a[i][j]=='@')
{
r=i;
t=j;
//break;
}
count=0;
dfs(r,t,k);
printf("%d\n",count);
}
return 0;
}
#include<string.h>
char a[130][130];
int vis[130][130];
int n,m,count;
//int x[4]={1,-1,0,0};
//int y[4]={0,0,-1,1};
void dfs(int r,int t,int s)
{
int i;
if(r>=m||r<0||t>=n||t<0||vis[r][t])
return ;
if(a[r][t]=='#')
return ;
++count;
vis[r][t]=1;
dfs(r,t+1,s);
dfs(r-1,t,s);
dfs(r,t-1,s);
dfs(r+1,t,s);
//vis[r][t]=0;
// for( i=0;i<4;i++)
// {
// dfs(x[i]+r,y[i]+t,s);
// }
}
int main(){
int i,j,k,r,t;
while(~scanf("%d%d",&n,&m))
{
for(i=0;i<m;i++)
scanf("%s",a[i]);
memset(vis,0,sizeof(vis));
for(i=0;i<m;i++)
for(j=0;j<n;j++)
if(a[i][j]=='@')
{
r=i;
t=j;
//break;
}
count=0;
dfs(r,t,k);
printf("%d\n",count);
}
return 0;
}
0 0
- Red and Black
- red and black
- HDUOJ1312 Red and Black
- Red and Black
- red and black
- Red and Black
- HDOJ Red and Black
- HDU1312( Red and Black )
- Red and Black
- hdu1312 Red and Black
- 深搜:Red and Black
- 1038 Red and Black
- HDU1312 Red and Black
- HDU Red and Black
- Red and Black
- HDU1312:Red and Black
- 1001Red and Black
- Red and Black 搜索
- 59A - Word
- Linux学习内容——我想学学完这些应该高手了
- Linux学习内容--我认为已经足够了
- Letter Combinations of a Phone Number
- .Class, Class.forName, .getClass()的区别
- Red and Black
- C++中的向上类型转换和向下类型转换
- C++中重定义、重写、重载的区别以及隐藏与覆盖的访问
- C++ 虚函数表解析
- C++中虚函数工作原理和(虚)继承类的内存占用大小计算
- C++ primer plus(第六版)学习笔记、习题答案(4.2)
- 数字图象处理之二维码图像提取算法(四)
- STM32入门篇之通用定时器彻底研究新手教程,含11个例程,全面剖析TIMER,另外有个2.0库的
- 在ubuntu系统上生成SSH密钥,并把对应的公开密钥添加到GitHub账户