Red and Black
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 13482 Accepted Submission(s): 8354
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
45 59 6 13
'.' 可走的点 '#' 不可走的点 '@' 开始搜索起点
思路:深搜 (DFS),通过四向搜索将 可走的点 变为 不可走的点 ,直到全部,不可再走,记录所有可走的点数。
已AC代码:
#include<cstdio>
#include<cstring>
int n,m,num;
char map[30][30];
int dx[]={0,0,1,-1};
int dy[]={1,-1,0,0};
void DFS(int x,int y) // 深搜
{
if(x<0||x>=m||y<0||y>=n) // 判断是否越界
return ;
if(map[x][y]=='#') // 判断是否可走
return ;
map[x][y]='#'; // 将走过的变为 不可走“#”
num++; // 可走步数加 1
for(int i=0;i<4;++i) // 向 四个方向搜索
{
int nx=x+dx[i];
int ny=y+dy[i];
DFS(nx,ny);
}
}
int main()
{
while(scanf("%d%d",&n,&m),n,m)
{
int i,j,st,ed;
memset(map,'\0',sizeof(map));
for(i=0;i<m;++i)
scanf("%s",map[i]);
for(i=0;i<m;++i) // 查找开始位点 “@”
for(j=0;j<n;++j)
if(map[i][j]=='@')
st=i,ed=j;
num=0;
DFS(st,ed);
printf("%d\n",num);
}
return 0;
}