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.
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)
The end of the input is indicated by a line consisting of two zeros.
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)
The end of the input is indicated by a line consisting of two zeros.
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 613
搜索水题,求所有可到达的黑色砖块的个数,DFS和BFS皆可。
BFS:
#include <iostream> #include <cstring> #include <queue> using namespace std; int W,H; int sx,sy; char maps[22][22]; bool vis[22][22]; int dx[4] = {1,0,-1,0},dy[4] = {0,1,0,-1}; typedef pair<int,int> P; int BFS(int x,int y) { memset(vis,0,sizeof(vis)); queue<P> que; que.push(P(x,y)); vis[x][y] = true; int cnt = 1; while(que.size()) { P p = que.front(); que.pop(); for(int i = 0;i < 4;i++) { int nx = p.first + dx[i],ny = p.second + dy[i]; if(0 <= nx && nx < H && 0 <= ny && ny < W && !vis[nx][ny] && maps[nx][ny] == '.') { que.push(P(nx,ny)); vis[nx][ny] = true; cnt++; } } } return cnt; } int main(int argc, char const *argv[]) { while(cin >> W >> H && W && H) { for(int i = 0;i < H;i++) for(int j = 0;j < W;j++) { cin >> maps[i][j]; if(maps[i][j] == '@') { sy = j; sx = i; } } cout << BFS(sx,sy) << endl; } return 0; }
DFS:#include <iostream> #include <cstring> using namespace std; int W,H; int sx,sy; char maps[22][22]; bool vis[22][22]; int dx[4] = {1,0,-1,0},dy[4] = {0,1,0,-1}; int res; void DFS(int x,int y) { for(int i = 0;i < 4;i++) { int nx = x + dx[i],ny = y + dy[i]; if(0 <= nx && nx < H && 0 <= ny && ny < W && !vis[nx][ny] && maps[nx][ny] == '.') { vis[nx][ny] = true; res++; DFS(nx,ny); } } } int main(int argc, char const *argv[]) { while(cin >> W >> H && W && H) { for(int i = 0;i < H;i++) for(int j = 0;j < W;j++) { cin >> maps[i][j]; if(maps[i][j] == '@') { sy = j; sx = i; } } memset(vis,0,sizeof(vis)); res = 1; vis[sx][sy] = true; DFS(sx,sy); cout << res << endl; } return 0; }