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
|
#include <stdio.h>
int n,m,cnt; bool isvisit[105][105]; char a[105][105]; const int next[8][2] = {{0,1},{0,-1},{1,0},{-1,0},{1,1},{1,-1},{-1,1},{-1,-1}};
bool ok(int x, int y) { return ~x&&x<n&&~y&&y<m&&a[x][y]=='W'&&!isvisit[x][y]; }
void dfs(int x, int y) { isvisit[x][y] = true; for (int i = 0;i<8;i++) { int nx = x+next[i][0]; int ny = y+next[i][1]; if (ok(nx,ny)) { dfs(nx,ny); } } }
int main() {
#ifdef LOCAL freopen("d:\\data.in", "r", stdin); #endif scanf("%d%d", &n, &m); getchar(); for (int i = 0; i<n; i++) { for (int j = 0; j<m; j++) { a[i][j] = getchar(); } getchar(); } for (int i = 0; i<n; i++) { for (int j = 0; j< m ;j++) { if (!isvisit[i][j]&&a[i][j]=='W') { cnt++; dfs(i,j); } } } printf("%d\n", cnt); return 0; }
|