I - 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.

InputThe 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) 
OutputFor 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
题目的大意就是搜图判断最多能遍历多少个".";简单dfs

#include<iostream>
#include<cstring>
using namespace std;
int w,h,ans;
char arr[][];
int mark[][];
int d[][]={{,},{,},{,-},{-,}};
void dfs(int x,int y)
{
    mark[x][y]=;
    for(int i=;i<;i++){
        int dx=x+d[i][];
        int dy=y+d[i][];
        if(dx>=&&dy>=&&dx<h&&dy<w&&mark[dx][dy]==&&arr[dx][dy]=='.'){
            ans++;
            mark[dx][dy]=;
            dfs(dx,dy);
        }
    }
} 

int main()
{
    while(cin>>w>>h){
        memset(mark,,sizeof(mark));
        ans=;
        if(w==&&h==)
            break;
        for(int i=;i<h;i++){
            scanf("%s",&arr[i]);
        }
        for(int i=;i<h;i++)
            for(int j=;j<w;j++){
                if(arr[i][j]=='@'){
//                    mark[i][j]=1;
                    dfs(i,j);
                }
            }
            cout<<ans<<endl;

    }
    return ;
}

BFS也可以写就是只要是x周围存在"."就加1,

#include<iostream>
#include<queue>
#include<cstring>
using namespace std;
char arr[][];
int sa,ea;
int n,m;
int v[][]={};
struct stu{
    int a,b;
//    int sum;
};

int a[]={,,,-};
int b[]={,,-,};

void bfs()
{
    int ans=;
//    priority_queue<stu >que;
    queue<stu>que;
    stu q1;
    q1.a=sa;
    q1.b=ea;
//    q1.sum=1;
    v[sa][ea]=;
    que.push(q1);

    while(que.size()){
        stu h;
//        h=que.top();
        h=que.front();
        que.pop();
        stu d;
        for(int i=;i<;i++){
            d.a=h.a+a[i];
            d.b=h.b+b[i];
            if(d.a>= && d.b>= && d.a<m && d.b<n&& v[d.a][d.b]!= && arr[d.a][d.b]!='#'){
                v[d.a][d.b]=;
//                d.sum=h.sum+1;
//                cout<<d.sum<<endl;
                que.push(d);
//                ans=max(ans,d.sum);
                ans++;//只要加入到队列中就加一，因为加入到队列的一定是'.'
            }
        }
    }
    cout<<ans+<<endl;
}

int main(){

    while(cin>>n>>m)
    {
        memset(v,,sizeof(v));

        if(n==&&m==)
            break;

        for(int i=;i<m;i++){
            scanf("%s",&arr[i]);
        }

        for(int i=;i<m;i++){
            for(int j=;j<n;j++){
                if(arr[i][j]=='@'){
                    sa=i;
                    ea=j;
                }
            }
        }

        bfs();
    }
    return ;
}