LightOJ 1012 Guilty Prince

简单广搜

#include <bits/stdc++.h>
using namespace std;

struct P
{
    int r, c;
    P(){}
    P(int _r, int _c){r = _r; c = _c;}
};

int r, c;
char maze[25][25];
bool vis[25][25];
int rm[4] = {0, 0, -1, 1};
int cm[4] = {-1, 1, 0, 0};

int bfs()
{
    queue<P> q;
    for(int i = 1; i <= r; i++)
        for(int j = 1; j <= c; j++)
            if(maze[i][j] == '@') q.push(P(i,j)), vis[i][j] = true;
    while(!q.empty())
    {
        P p = q.front(); q.pop();
        for(int i = 0; i < 4; i++)
        {
            int nr = p.r + rm[i], nc = p.c + cm[i];
            if(maze[nr][nc] == '.' && !vis[nr][nc])
                q.push(P(nr, nc)), vis[nr][nc] = true;
        }
    }
    int cnt = 0;
    for(int i = 1; i <= r; i ++)
        for(int j = 1; j <= c; j++)
            if(vis[i][j]) cnt++;
    return cnt;
}

int main()
{
    int T;
    scanf("%d", &T);

    for(int ca = 1; ca <= T; ca++)
    {
        memset(maze, 0, sizeof(maze));
        memset(vis, false, sizeof(vis));
        scanf("%d%d", &c, &r);

        for(int i = 1; i <= r; i++)
            scanf("%s", maze[i] + 1);

        printf("Case %d: %d\n", ca, bfs());
    }

    return 0;
}