light oj 1012 Guilty Prince(dfs )

1012 - Guilty Prince

 

题目链接： http://lightoj.com/volume_showproblem.php?problem=1012

Once there was a king named Akbar. He had a son named Shahjahan. For an unforgivable reason the king wanted him to leave the kingdom. Since he loved his son he decided his son would be banished in a new place. The prince became sad, but he followed his father's will. In the way he found that the place was a combination of land and water. Since he didn't know how to swim, he was only able to move on the land. He didn't know how many places might be his destination. So, he asked your help.

For simplicity, you can consider the place as a rectangular grid consisting of some cells. A cell can be a land or can contain water. Each time the prince can move to a new cell from his current position if they share a side.

Now write a program to find the number of cells (unit land) he could reach including the cell he was living.

Input

Input starts with an integer T (≤ 500), denoting the number of test cases.

Each case starts with a line containing two positive integers W and H; W and H are the numbers of cells in the x and y directions, respectively. W and H are not more than 20.

There will be H more lines in the data set, each of which includes W characters. Each character represents the status of a cell as follows.

1) '.' - land

2) '#' - water

3) '@' - initial position of prince (appears exactly once in a dataset)

Output

For each case, print the case number and the number of cells he can reach from the initial position (including it).

Sample Input	Output for Sample Input
4 6 9 ....#. .....# ...... ...... ...... ...... ...... #@...# .#..#. 11 9 .#......... .#.#######. .#.#.....#. .#.#.###.#. .#.#..@#.#. .#.#####.#. .#.......#. .#########. ........... 11 6 ..#..#..#.. ..#..#..#.. ..#..#..### ..#..#..#@. ..#..#..#.. ..#..#..#.. 7 7 ..#.#.. ..#.#.. ###.### ...@... ###.### ..#.#.. ..#.#..

题目大意： 简单来说 就是与"@"符号连在一起的点有几个，“@”也算一个，就是这个样子，，可以用bfs 也可以用bfs ，模板题

#include <stdio.h>
#include <string.h>

bool vis[25][25];               //访问标记，访问了为1 没访问的为0 
char map[25][25];               //地图
int dir[4][2] = {0,1,0,-1,1,0,-1,0};        //四个方向， 分别是下，上，右，左
int w,h,res;
int check(int x,int y)
{
    if( vis[x][y] == 0 && x >= 0 && x < h && y >= 0 && y < w && map[x][y] == '.')   //判断能不能走
    {
        return 1;
    }
    else 
    {
        return 0;
    }
}
void dfs(int x,int y)
{
    
    vis[x][y] = 1;
    for (int i = 0 ; i < 4 ; i++ )      //四个方向都试一次
    {
        if(check(x+dir[i][0],y+dir[i][1]))
        {
            res++;                  //如果可走，则结果++
            dfs(x+dir[i][0],y+dir[i][1]);
        }

    }
    return ;
}
int main()
{
    int t;
    scanf("%d",&t);
    for (int cas = 1; cas <= t ; cas++ )
    {
        res = 1;
        memset(vis,0,sizeof(vis));
        scanf("%d %d",&w,&h);
        getchar();
        int x,y;        //记录"@"符号的坐标
        for (int  i = 0 ; i < h; i++ )
        {
            for (int  j = 0 ; j < w ; j++ )
            {
                scanf("%c",&map[i][j]);
                if ( map[i][j] == '@')  
                {
                    x = i;
                    y = j;
                }
            }
            getchar();
        }
        
        dfs(x,y);
        printf("Case %d: %d\n",cas,res);
    }
    return 0;
}