POJ 2867 Red and Black｜DFS

描述

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)
The end of the input is indicated by a line consisting of two zeros.

输出

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

因为BFS要用queue，push进去的肯定是坐标，就要写结构体，感觉比较麻烦，就准备用DFS，自己写了一个有点傻乎乎的版本：

#include <iostream>
#include <queue>
#include <string.h>
using namespace std;

char map[25][25];
bool isvisited[25][25];
int cnt;
int w,h;

void DFS(int x,int y){
    cnt++;
    isvisited[x][y]=1;
    if(x-1>=0 && map[x-1][y]!='#' && isvisited[x-1][y]==0) DFS(x-1,y);
    if(x+1<h && map[x+1][y]!='#' && isvisited[x+1][y]==0) DFS(x+1,y);
    if(y-1>=0 && map[x][y-1]!='#' && isvisited[x][y-1]==0) DFS(x,y-1);
    if(y+1<w && map[x][y+1]!='#' && isvisited[x][y+1]==0) DFS(x,y+1);   
}

int main(){
    while(cin>>w>>h){
        int startx,starty;
        memset(isvisited,0,sizeof(isvisited));
        cnt=0;
        if (w==0 && h==0) break;
        for(int i=0;i<h;i++){
            for(int j=0;j<w;j++){
                cin>>map[i][j];
                if(map[i][j]=='@'){
                    startx=i;
                    starty=j;
                }
            }
        }
        DFS(startx , starty);
        cout<<cnt<<endl;
    }
    return 0;
}

然后参考了一下别人的代码，一是判断那里，重复太多，二是判断是否访问过这个不需要重开一个数组，直接把原来走过的路改成墙就行：

#include <iostream>
#include <queue>
#include <string.h>
using namespace std;

char map[25][25];
int cnt;
int w,h;

void DFS(int x,int y){
    if(x<0||x>=h||y<0||y>=w) return;
    if(map[x][y]=='#') return;
    cnt++;
    map[x][y]='#';
    DFS(x-1,y);
    DFS(x+1,y);
    DFS(x,y-1);
    DFS(x,y+1);   
}

int main(){
    while(cin>>w>>h){
        int startx,starty;
        cnt=0;
        if (w==0 && h==0) break;
        for(int i=0;i<h;i++){
            for(int j=0;j<w;j++){
                cin>>map[i][j];
                if(map[i][j]=='@'){
                    startx=i;
                    starty=j;
                }
            }
        }
        DFS(startx , starty);
        cout<<cnt<<endl;
    }
    return 0;
}