hdu 1312 Red and Black

Red and Black

*Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 41163 Accepted Submission(s): 24986
*

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

Source

Asia 2004, Ehime (Japan), Japan Domestic

Submit

#include <bits/stdc++.h>
using namespace std;
char room[23][23];
int dir[4][2] = {
    {-1, 0}, //向左
    {0, -1}, //向上
    {1, 0},  //向右
    {0, 1}}; //向下
int Wx, Hy, num;//Wx行，Hy列，用num统计可走的位置有多少
#define CHECK(x, y) (x < Wx && x >= 0 && y >= 0 && y < Hy)//是否在room中
struct node
{
    int x, y;
};
void BFS(int dx, int dy)//起点也包含在砖块内
{
    num = 1;
    queue<node> q;//队列中放坐标点
    node start, next;
    start.x = dx;
    start.y = dy;
    q.push(start);
    while (!q.empty())
    {
        start = q.front();
        q.pop();
        for (int i = 0; i < 4; i++)//按左上右下顺时针逐一搜索
        {
            next.x = start.x + dir[i][0];
            next.y = start.y + dir[i][1];
            if (CHECK(next.x, next.y) && room[next.x][next.y] == '.')
            {
                room[next.x][next.y] = '#';//进队列之后标记为已经处理过
                num++;
                q.push(next);
            }
        }
    }
}
int main()
{
    int x, y, dx, dy;
    while (cin >> Wx >> Hy)//Wx行，Hy列
    {
        if (Wx == 0 && Hy == 0)//结束
            break;
        for (y = 0; y < Hy; y++)//有Hy行
        {
            for (x = 0; x < Wx; x++)//一次读入一行
            {
                cin >> room[x][y];
                if (room[x][y] == '@')//读入起点
                {
                    dx = x;
                    dy = y;
                }
            }
        }
        num = 0;
        BFS(dx, dy);
        cout << num << endl;
    }
    return 0;
}