Red and Black【DFS】

最新推荐文章于 2020-04-30 10:29:15 发布

Steven-NaGuT

最新推荐文章于 2020-04-30 10:29:15 发布

阅读量113

点赞数

分类专栏：算法题解文章标签：算法

本文链接：https://blog.csdn.net/weixin_45619734/article/details/103958360

版权

算法题解专栏收录该内容

102 篇文章 3 订阅

订阅专栏

题目描述：原题链接

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)
The end of the input is indicated by a line consisting of two zeros.
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

思路：

利用递归，对所走过的点进行标记，并判断边界。

#include <iostream>
#include <algorithm>
using namespace std;
const int dx[] = {-1,0,1,0};
const int dy[] = {0,-1,0,1};
int cnt = 0;
char s[20][20];
int vis[20][20];
int r,c;
void dfs(int r2 , int c2)
{
    for(int i=0;i<4;i++)
    {
        if((r2+dx[i]>=0)&&(r2+dx[i]<r)&&(c2+dy[i]>=0)&&(c2+dy[i]<c)&&(vis[r2+dx[i]][c2+dy[i]]==0)&&(s[r2+dx[i]][c2+dy[i]]=='.'))
        {
            cnt++;
            vis[r2+dx[i]][c2+dy[i]]=1;
            dfs(r2+dx[i],c2+dy[i])
        }
    }
}
int main()
{

    int r1 = 0,c1 = 0;
    while(cin>>c>>r&&c)
    {
    for(int i=0;i<r;i++)
        for(int j=0;j<c;j++)
        {
            cin>>s[i][j];
            vis[i][j]=0;
            if(s[i][j]=='@')
            {
                r1 = i;
                c1 = j;
            }
        }
    dfs(r1,c1);
    cout<<cnt+1<<endl;
    }
    return 0;
}