【hdoj 1312】Red and Black

Red and Black

Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)

Total Submission(s): 12047 Accepted Submission(s): 7496

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

题意理解：在一个有黑色和红色的板砖的房间，有一个人站在黑色板砖上，他只能在黑色的板砖上行走，计算出他能走的板砖的个数，不要重复。

解题思路：写一个方向数组用于移动，一个ok函数判断坐标是否越界。将人走过的板砖赋值为1，再次经过这个板砖的时候不再累加。DFS遍历数组。

code：

#include <iostream>
#include <string.h>
#include <algorithm>
#include <cstdio>
using namespace std;
int col ,row;
int cnt;
char a[25][25];
int v[25][25];
int dir[4][2]={{0,1},{-1,0},{0,-1},{1,0}};
int ok(int x,int y)
{
    if(x<0||y<0||x>=row||y>=col)
        return 0;
    return 1;
}
void DFS(int x0,int y0)
{
    for(int k=0;k<4;k++)
    {
        int x = x0+dir[k][0];
        int y = y0+dir[k][1];
        if(a[x][y]=='.'&&ok(x,y)&&v[x][y]==0)
        {
            v[x][y] = 1;
            cnt++;
            DFS(x,y);
        }
    }
}
int main()
{
    int sx,sy;
    while(scanf("%d%d",&col,&row)!=EOF&&(col&&row))
    {
        cnt=0;
        memset(v,0,sizeof(v));
        for(int i=0;i<row;i++)
        {
            scanf("%s",a[i]);
            for(int j=0;j<col;j++)
            {
                if(a[i][j]=='@')
                {
                    sx=i;
                    sy=j;
                }
            }
        }
        v[sx][sy]=1;
        cnt++;
        DFS(sx,sy);
        printf("%d\n",cnt);
    }
    return 0;
}