Red and Black（bfs）

最新推荐文章于 2022-01-12 23:41:22 发布

fanlinqiang

最新推荐文章于 2022-01-12 23:41:22 发布

阅读量498

点赞数

分类专栏：搜索文章标签： each character output numbers input

本文链接：https://blog.csdn.net/flqbestboy/article/details/7848916

版权

搜索专栏收录该内容

9 篇文章 0 订阅

订阅专栏

Red and Black

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

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

题目大意："."代表黑板，“#”代表红板，“@”代表人的位置（也是黑板），现在问给定一个区域内的红板和黑板分布，

求出人所能连续走黑板的最大数，黑板可以重复走

解题：bfs

#include<cstdio>
#include<iostream>
#include<cstring>
#include<queue>
const int M=25;
char map[M][M];
bool mark[M][M];
int move[4][2]={{1,0},{0,1},{-1,0},{0,-1}};//位移数组
int n,m,i,j,counter;
struct node
{
    int x,y;
}p,q;
using namespace std;
int main()
{
    while(scanf("%d%d",&n,&m),n+m)//列、行
    {
        for(i=1;i<=m;i++)
        {
          getchar();//这一步很重要
          for(j=1;j<=n;j++)
           {
               scanf("%c",&map[i][j]);
               if(map[i][j]=='@')
               {
                 p.x=i,p.y=j;
               }
           }
        }
        queue<node>Q;
        Q.push(p);
        memset(mark,true,sizeof(mark)),mark[p.x][p.y]=false;
        counter=1;
        while(!Q.empty())
        {
            p=Q.front(),Q.pop();
            for(i=0;i<4;i++)
            {
                q.x=p.x+move[i][0],q.y=p.y+move[i][1];
                if(q.x>=1&&q.x<=m&&q.y>=1&&q.y<=n&&mark[q.x][q.y]&&map[q.x][q.y]=='.')
                {
                    mark[q.x][q.y]=false;
                    counter++;
                    Q.push(q);
                }
            }
        }
        printf("%d\n",counter);
    }
    return 0;
}