BFS A - Red and Black(寒假集训）

题目HDU-1312
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
学习BFS的第一道入门题目，所谓BFS即广度优先算法，按照树的层次遍历过程按照所给条件平行节点寻找。
首先利用dir数组来存储上下左右四个方向，s来存储整个字符行列，vis来表示这个节点有没有被访问过。
其次做init，check，BFS三个子函数来分别表示输入，判断，寻找作用。
至于BFS内部则从人开始位置重复四个方向上的走法，并判断这个点是否满足要求，如果要求则将该点压入栈中并标记已走过，否则进行下一个方向判断。

#include <stdio.h>
#include<string.h>
#include<iostream>
#include<algorithm>
#include<queue>
using namespace std;
const int maxn = 25;

char s[maxn][maxn];
int n, m