poj 2386

最新推荐文章于 2022-07-24 19:58:51 发布

weixin_30896825

最新推荐文章于 2022-07-24 19:58:51 发布

阅读量41

点赞数

CC 4.0 BY-SA版权

原文链接：http://www.cnblogs.com/avema/p/3774144.html

简单dfs

#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <vector>
#include <sstream>
#include <string>
#include <cstring>
#include <algorithm>
#include <iostream>
#define maxn 100010
#define INF 0x7fffffff
#define inf 100000000
#define MOD 1000000007
#define ULL unsigned long long
#define LL long long

using namespace std;

bool vis[110][110];
char mmap[110][110];
int n, m;

void dfs(int x, int y) {
    vis[x][y] = 1;
    if(!vis[x+1][y] && mmap[x+1][y] == 'W') {
        dfs(x+1, y);
    }
    if(!vis[x-1][y] && mmap[x-1][y] == 'W') {
        dfs(x-1, y);
    }
    if(!vis[x][y+1] && mmap[x][y+1] == 'W') {
        dfs(x, y+1);
    }
    if(!vis[x][y-1] && mmap[x][y-1] == 'W') {
        dfs(x, y-1);
    }
    if(!vis[x+1][y+1] && mmap[x+1][y+1] == 'W') {
        dfs(x+1, y+1);
    }
    if(!vis[x+1][y-1] && mmap[x+1][y-1] == 'W') {
        dfs(x+1, y-1);
    }
    if(!vis[x-1][y+1] && mmap[x-1][y+1] == 'W') {
        dfs(x-1, y+1);
    }
    if(!vis[x-1][y-1] && mmap[x-1][y-1] == 'W') {
        dfs(x-1, y-1);
    }
}

int main()
{
    while(scanf("%d%d", &n, &m) == 2) {
        memset(vis, 0, sizeof(vis));
        for(int i = 1; i <= n; ++ i) {
            scanf("%s", mmap[i]+1);
        }
        int ans = 0;
        for(int i = 1; i <= n; ++ i) {
            for(int j = 1; j <= m; ++ j) {
                if(!vis[i][j] && mmap[i][j] == 'W') {
                    ++ ans;
                    dfs(i, j);
                }
            }
        }
        printf("%d\n", ans);
    }
    return 0;
}

转载于:https://www.cnblogs.com/avema/p/3774144.html