HDU 1241 dfs入门练手题

天才少年伊泽瑞尔

于 2022-08-04 20:51:32 发布

阅读量163

点赞数 1

分类专栏： ACM steps 文章标签：深度优先

本文链接：https://blog.csdn.net/zhao_xin_ran/article/details/126166521

版权

ACM steps 专栏收录该内容

27 篇文章 0 订阅

订阅专栏

// Problem: Oil Deposits
// Contest: HDOJ
// URL: http://acm.hdu.edu.cn/showproblem.php?pid=1241
// Memory Limit: 65 MB
// Time Limit: 2000 ms
//
// Powered by CP Editor (https://cpeditor.org)

#include <bits/stdc++.h>

using namespace std;

const int N = 105;
int n, m;
char a[N][N];
int dir[8][2] = {{1, 0}, {-1, 0}, {1, 1}, {1, -1}, {-1, -1}, {-1, 1}, {0, 1}, {0, -1}};
bool ok(int x, int y)
{
    if (x < 1 || x > n || y < 1 || y > m)
        return false;
    return true;
}
void dfs(int x, int y)
{
    a[x][y] = '*';
    for (int i = 0; i < 8; i++)
    {
        x += dir[i][0];
        y += dir[i][1];
        if (ok(x, y) && a[x][y] == '@')
        {
            dfs(x, y);
        }
    }
}

int main()
{
    while (cin >> n >> m, n)
    {
        for (int i = 1; i <= n; i++)
        {
            for (int j = 1; j <= m; j++)
            {
                cin >> a[i][j];
            }
            getchar();
        }
        int count = 0;
        for (int i = 1; i <= n; i++)
        {
            for (int j = 1; j <= m; j++)
            {
                if (a[i][j] == '@')
                {
                    dfs(i, j);
                    count++;
                }
            }
        }
        printf("%d\n", count);
    }
}