1038 Red and Black

1038 Red and Black

Red and Black

时间限制: 1秒  内存限制: 64M

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.

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.

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

//注意：输出样例与题目实际要求不符！

Source

http://acm.pku.edu.cn/JudgeOnline/problem?id=1979

一目了然，DFS，既然我能写出来，证明这道题必然很水

递归DFS，直接出结果

没有要解释的

注意：仔细看题！输出样例不一定和题目叙述的一样，尤其是这种粘过来的题。

这已经是第二次被OJ的输出样例坑了

还能更背么。

1. #include<stdio.h>  
2. #include<string.h>  
3. char a[25][25];  
4. int find(int x,int y)  
5. {  
6.     int u = 0, d = 0 , r = 0, l = 0;  
7.     a[x][y] = 0;  
8.     if ( a[x-1][y] != -1 && a[x-1][y] != 0 ) r = find(x-1,y);  
9.     if ( a[x][y+1] != -1 && a[x][y+1] != 0 ) u = find(x,y+1);  
10.     if ( a[x+1][y] != -1 && a[x+1][y] != 0 ) l = find(x+1,y);  
11.     if ( a[x][y-1] != -1 && a[x][y-1] != 0 ) d = find(x,y-1);  
12.     return ( u+d+r+l +1 );  
13. }  
14. int main()  
15. {  
16.     int W,H,X,Y;  
17.     while ( scanf("%d%d\n",&W,&H), W || H )  
18.     {  
19.         int i,j;  
20.         memset(a,-1,sizeof(a));  
21.         for ( i = 1; i <= H; i ++ )  
22.         {  
23.             for ( j = 1; j <= W; j ++ )  
24.             {  
25.                 scanf("%c",&a[i][j]);  
26.                 if ( a[i][j] == '\n' ) scanf("%c",&a[i][j]);  
27.                 if ( a[i][j] == '@' )   
28.                 {  
29.                     X = i;  
30.                     Y = j;  
31.                 }  
32.                 if ( a[i][j] == '#' ) a[i][j] = -1;  
33.             }  
34.         }  
35.         printf("%d\n",find(X,Y));  
36.     }  
37.     return 0;  
38. }