G - Red and Black
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.
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.
Write a program to count the number of black tiles which he can reach by repeating the moves described above.
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 0Sample Output
45 59 6 13
题意:求 从@处 能到达的 所有 “.”点。
思路:广搜,深搜都可以。
深搜代码:
#include<stdio.h>
#include<string.h>
#include<iostream>
#include<algorithm>
#define mem(a,b) memset(a,b,sizeof(a))
using namespace std;
int ne[4][2]={{0,1},{-1,0},{0,-1},{1,0}};
char tu[25][25]={'0'};
int step,W,H;
int dfs(int x,int y)
{
int tx,ty;
step++;
tu[x][y]='#'; //已经搜过,标记
for(int i=0;i<4;i++)
{
tx=x+ne[i][0];
ty=y+ne[i][1];
if(tu[tx][ty]=='.'&&tx>=0&&ty>=0&&tx<H&&ty<W)
{
dfs(tx,ty);
}
}
return step;
}
int main()
{
while(~scanf("%d%d",&W,&H)&&(W||H))
{
getchar();
int x,y;
step=0;
for(int i=0;i<H;i++)
{
for(int j=0;j<W;j++)
{
scanf("%c",&tu[i][j]);
if(tu[i][j]=='@')
{
x=i;
y=j;
}
}
getchar();
}
cout<<dfs(x,y)<<endl;
}
return 0;
}