Red and Black
Time Limit: 1000MS | Memory Limit: 30000K | |
Total Submissions: 22435 | Accepted: 12117 |
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)
The end of the input is indicated by a line consisting of two zeros.
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.
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
题意:有间长方体的房子,地上铺了红色,黑色,两种颜色的正方体的瓷砖,站在其中一块黑色的瓷砖上,只能向相邻的黑色瓷砖移动,计算总共能够到达多少快黑色的瓷砖
"."黑色瓷砖
"#"白色瓷砖
"@"黑色瓷砖,并且是你的初始位置
f(x,y)=1+f(x-1,y)+f(x+1,y)+f(x,y-1)+f(x,y+1).
#include <iostream>
using namespace std;
int w,h;
char z[21][21];
int fun(int x,int y)
{
if(x<0|| x>=h||y<0|| y>=w)走出矩阵范围
{
return 0;
}
if(z[x][y]=='#')
{
return 0;
}
z[x][y]='#'; //走过的额做标记
return 1+fun(x-1, y)+fun(x+1, y)+fun(x, y+1)+fun(x, y-1);
}
int main()
{
while (cin>>w>>h && (w||h))
{
for (int i=0; i<h; i++)
{
cin>>z[i];
}
for (int i=0; i<h; i++)
{
for (int j=0; j<w; j++)
{
if(z[i][j]=='@')
{
cout<<fun(i, j)<<endl;;
}
}
}
}
return 0;
}