首页 > 代码库 > poj 2386

poj 2386

2024-07-07 09:23:10   225人阅读

简单dfs

?
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
#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;
}

　　


联系
我们