题目
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.
输入
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)
The end of the input is indicated by a line consisting of two zeros.
输出
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).
思路
用深度优先搜索寻找符合条件的格子。
#include<iostream>
#include<stdio.h>
#include<string.h>
using namespace std;
char map[23][23];
int search(int x, int y)
{
int ans=0;
if(map[x][y]=='#') ans=0;
else if(map[x][y] == '.' || map[x][y]=='@')
{
map[x][y] = '#';
//cout << "black" << endl;
ans++;
ans+=search(x-1, y);
ans+=search(x+1, y);
ans+=search(x, y-1);
ans+=search(x, y+1);
}
return ans;
}
int main()
{
int w,h;//宽高
int x,y,ans=0;
char c;
while(scanf("%d %d", &w, &h), w&&h)
{
memset(map, '#', sizeof(map));//铺满红色地板
for(int i = 1; i<=h; i++)
{
for(int j=1; j<=w; j++)
{
cin >> c;
if(c == '@') x=i, y=j;
map[i][j] = c;
}
}
ans = search(x, y);
printf("%d\n", ans);
}
return 0;
}