hdu1312——Red and Black【DFS/BFS】

Red and Black

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 25836    Accepted Submission(s): 15596

 

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

这道题属于BFS,DFS板子题，两种写法都能过。

DFS写法：

#include<algorithm>
#include<cstdio>
#include<iostream>
#include<cstring>
#include<queue>
using namespace std;
const int MAXN=100;
char mp[MAXN][MAXN];
int vis[MAXN][MAXN];
int row,coloumn;//矩阵的行数和列数
int dx[4]={1,0,-1,0},dy[4]={0,-1,0,1};
int ans;
void DFS(int x,int y){
    //memset(vis,0,sizeof(vis));
    vis[x][y]=1;
    for(int i=0;i<4;i++){
        int nx=x+dx[i];
        int ny=y+dy[i];
        if(mp[nx][ny]!='#'&&nx>=0&&nx<row&&ny>=0&&ny<coloumn&&!vis[nx][ny]){
            ans++;
            DFS(nx,ny);
        }
    }
}
int main(){
    while(~scanf("%d%d",&coloumn,&row)&&coloumn,row){
        ans=1;
        int sx=0,sy=0;
        memset(vis,0,sizeof(vis));
        for(int i=0;i<row;i++) scanf("%s",mp[i]);
        for(int i=0;i<row;i++){
            for(int j=0;j<coloumn;j++){
                if(mp[i][j]=='@'){
                    sx=i;
                    sy=j;
                }
            }
        }
        DFS(sx,sy);
        printf("%d\n",ans);
    }
    return 0;
}

BFS写法：

#include<algorithm>
#include<cstdio>
#include<iostream>
#include<cstring>
#include<queue>
using namespace std;
const int MAXN=110;
char mp[MAXN][MAXN];
int vis[MAXN][MAXN];
int sx,sy,row,coloumn,ans;
int dx[4]={1,0,-1,0},dy[4]={0,-1,0,1};
struct node{
    int x,y;
};
void BFS(){
    queue<node> qu;
    //memset(vis,0,sizeof(vis));
    node e1;
    e1.x=sx,e1.y=sy;
    qu.push(e1);
    vis[sx][sy]=1;
    ans=1;
    while(!qu.empty()){
        e1=qu.front();qu.pop();
        node e2;
        for(int i=0;i<4;i++){
            e2.x=e1.x+dx[i];
            e2.y=e1.y+dy[i];
            if(e2.x>=0&&e2.x<row&&e2.y>=0&&e2.y<coloumn&&!vis[e2.x][e2.y]&&mp[e2.x][e2.y]!='#'){
                ans++;
                vis[e2.x][e2.y]=1;
                qu.push(e2);
            }
        }
    }
    printf("%d\n",ans);
}
int main(){
    while(~scanf("%d%d",&coloumn,&row)&&coloumn,row){
        memset(vis,0,sizeof(vis));
        for(int i=0;i<row;i++) scanf("%s",mp[i]);
        for(int i=0;i<row;i++){
            for(int j=0;j<coloumn;j++){
                if(mp[i][j]=='@'){
                    sx=i;
                    sy=j;
                }
            }
        }
        BFS();
    }
    return 0;
}