杭电1312 Red and Black 深搜

Red and Black

Time Limit : 2000/1000ms (Java/Other)   Memory Limit : 65536/32768K (Java/Other)

Total Submission(s) : 18   Accepted Submission(s) : 16

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.

 

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)

 

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
   
   
//题意，从@开使搜，#是墙，输出一共有多少连在一起的.（加上@）；
   
   


   
   


   
   
#include <iostream>
#include<cstdio>
#include<algorithm>
#include<cstring>
#include<string>
#include<queue>
#include<cstdlib>
#include<map>
using namespace std;
int n,m;
char a[100][100];
int s;
int c[4][2]={0,-1,0,1,1,0,-1,0};
void ss(int x,int y)
{
    int i;
    if(x<0||y<0||x>=n||y>=m||a[x][y]=='#')
    return;
    else
    {
        s++;
        a[x][y]='#';
        for(i=0;i<4;i++)
        {
            ss(x+c[i][0],y+c[i][1]);
        }
    }


}
int main()
{
    while(scanf("%d%d\n",&m,&n))
    {
        if(n==0||m==0)
        break;
        s=0;
        int i,j;
        for(i=0;i<n;i++)
        gets(a[i]);
        for(i=0;i<n;i++)
        {
            for(j=0;j<m;j++)
            if(a[i][j]=='@')
            {
                ss(i,j);
            }
        }
        printf("%d\n",s);
    }
}