poj2386
简单题
View Code
#include
<
iostream
>
#include
<
cstdio
>
#include
<
cstdlib
>
#include
<
cstring
>
#include
<
queue
>
using
namespace
std;
#define
maxn 106
struct
XPoint
{
int
x;
int
y;
XPoint(
int
xx,
int
yy) :
x(xx), y(yy)
{
}
XPoint()
{
}
};
int
n, m;
bool
map[maxn][maxn];
bool
vis[maxn][maxn];
int
ans;
int
dir[
8
][
2
]
=
{
{
-
1
,
-
1
},
{
-
1
,
0
},
{
-
1
,
1
},
{
0
,
-
1
},
{
0
,
1
},
{
1
,
-
1
},
{
1
,
0
},
{
1
,
1
} };
bool
ok(
int
x,
int
y)
{
if
(x
<
0
||
y
<
0
||
x
>=
n
||
y
>=
m)
return
false
;
if
(vis[x][y])
return
false
;
return
map[x][y];
}
void
work(
int
x,
int
y)
{
ans
++
;
queue
<
XPoint
>
q;
q.push(XPoint(x, y));
vis[x][y]
=
true
;
while
(
!
q.empty())
{
XPoint temp
=
q.front();
q.pop();
for
(
int
i
=
0
; i
<
8
; i
++
)
if
(ok(temp.x
+
dir[i][
0
], temp.y
+
dir[i][
1
]))
{
vis[temp.x
+
dir[i][
0
]][temp.y
+
dir[i][
1
]]
=
true
;
q.push(XPoint(temp.x
+
dir[i][
0
], temp.y
+
dir[i][
1
]));
}
}
}
int
main()
{
//
freopen("t.txt", "r", stdin);
scanf(
"
%d%d
"
,
&
n,
&
m);
memset(map,
0
,
sizeof
(map));
memset(vis,
0
,
sizeof
(vis));
ans
=
0
;
getchar();
for
(
int
i
=
0
; i
<
n; i
++
)
{
for
(
int
j
=
0
; j
<
m; j
++
)
{
char
ch;
scanf(
"
%c
"
,
&
ch);
if
(ch
==
'
W
'
)
map[i][j]
=
true
;
}
getchar();
}
for
(
int
i
=
0
; i
<
n; i
++
)
for
(
int
j
=
0
; j
<
m; j
++
)
if
(
!
vis[i][j]
&&
map[i][j])
work(i, j);
printf(
"
%d\n
"
, ans);
return
0
;
}