【日常水题-bfs】Red and Black

　Poj 1979 Red and Black

　　题目大意：从@开始出发，“.”可走，“#”不可走，给出多组数据，“0 0”为结尾，求每组数据可以走到多少点（起点也算一个点）。

　　夏令营讲课的时候它的评价：

 

#include<cstdio>
#include<cstring>
#include<iostream>
using namespace std;
const int sz = 25;
char plat[sz][sz];
int n, m, ans = 0;
int q[sz*sz][3];
bool book[sz][sz];
int dx[8] = {-1,0,1,0}, dy[8] = {0,1,0,-1};
int bfs(int x,int y) {
    int head = 1, tail = 1, mx, my;
    q[head][1] = x, q[head][2] = y;
    book[x][y] = 1;
    while(head<=tail) {
        for(int i = 0; i < 4; i++) {
            mx = q[head][1] + dx[i];
            my = q[head][2] + dy[i];
            if(mx>=1&&my>=1&&mx<=m&&my<=n&&(plat[mx][my]!='#')&&(!book[mx][my])) {
                tail++;
                q[tail][1] = mx;
                q[tail][2] = my;
                book[mx][my] = 1;
            }
        }
        head++;
    }
    ans = tail;
    return ans;
}
int main() {
    while(1) {
        memset(book,0,sizeof(book));
        scanf("%d%d",&n,&m);
        if(n==0&&m==0) break;
        for(int i = 1; i <= m; i++) {
                scanf("%s",plat[i]+1);
        }
        for(int i = 1; i <= m; i++) {
            for(int j = 1; j <= n; j++)
            {
            //    printf("%c",s[i][j]);    
                if(plat[i][j]=='@') {
                    printf("%d\n",bfs(i,j));
                    break;
                }
            }
        }
    }
    return 0;
}

准备刷刷夏令营yhy讲课的搜索专题qwq

这是第一个stO Orz