HDOJ--1312--Red and Black

题目描述：
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.
输入描述:
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)
输出描述:
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).
输入：
6 9
…#.
…#
…
…
…
…
…
#@…#
.#…#.
11 9
.#…
.#.#######.
.#.#…#.
.#.#.###.#.
.#.#…@#.#.
.#.#####.#.
.#…#.
.#########.
…
11 6
…#…#…#…
…#…#…#…
…#…#…###
…#…#…#@.
…#…#…#…
…#…#…#…
7 7
…#.#…
…#.#…
###.###
…@…
###.###
…#.#…
…#.#…
0 0
输出：
45
59
6
13
题意：
这有一间铺满方形瓷砖的长方形客房。 每块瓷砖的颜色是红色或者黑色。 一个人站在一块黑色瓷砖上， 他可以从这块瓷砖移动到相邻的四块瓷砖中的一块。 但是他只能移动到黑色瓷砖上，而不能移动到红色瓷砖上。
编写一个程序，通过重复上述动作来计算他可以达到的黑色瓷砖的数量。
题解：
直接DFS
代码：

#include<cstdio>
#include<cstring>
#include<algorithm>
#include<iostream>
using namespace std;

const int maxn = 50;
char s[maxn][maxn];
int n,m,ans,sx,sy;
int dir[4][2]={{1,0},{-1,0},{0,1},{0,-1}};

void dfs(int x,int y){
    if(s[x][y] == '.'){
        ans ++;
    }
    s[x][y] = '#';
    for(int i = 0; i < 4; i ++){
        int dx = x + dir[i][0];
        int dy = y + dir[i][1];
        if(dx >= 0 && dx < n && dy >= 0 && dy < m && s[dx][dy] != '#'){
            dfs(dx,dy);
        }
    }
}

int main(){
    while(scanf("%d%d",&n,&m)!=EOF){
        if(n == 0 && m == 0) break;
        swap(n,m);
        for(int i = 0; i < n; i ++){
            scanf("%s",s[i]);
        }
        ans = 1;
        for(int i = 0; i < n; i ++){
            for(int j = 0; j < m; j ++){
                if(s[i][j] == '@'){
                    sx = i;
                    sy = j;
                }
            }
        }
        dfs(sx,sy);
        printf("%d\n",ans);
    }
    return 0;
}