Useful한
IT블로그

Useful한IT블로그

Featured

Posts

18422. Emacs - Useful Blog

#BOJ#C++

18422. Emacs

written by Useful·BOJ 18422


c
#include <bits/stdc++.h>

using namespace std;

bool isVisit[101][101];
char arr[101][101];

int main(){
    cin.tie(NULL);
    cout.tie

(

NULL

)

;

ios_base

::

sync_with_stdio

(

false

)

;

int

N

,

M

;

cin

>>

N

>>

M

;

for

(

int

i

=

0

;

i

<

N

;

i

++

)

{

string input

;

cin

>>

input

;

for

(

int

j

=

0

;

j

<

M

;

j

++

)

{

arr

[

i

]

[

j

]

=

input

[

j

]

;

}

}

int

ans

=

0

;

queue

<

pair

<

int

,

int

>>

bfsQ

;

for

(

int

i

=

0

;

i

<

N

;

i

++

)

{

for

(

int

j

=

0

;

j

<

M

;

j

++

)

{

if

(

arr

[

i

]

[

j

]

==

'*'

&&

!

isVisit

[

i

]

[

j

]

)

{

ans

++

;

bfsQ

.

push

(

make_pair

(

i

,

j

)

)

;

isVisit

[

i

]

[

j

]

=

true

;

while

(

!

bfsQ

.

empty

(

)

)

{

int

curX

=

bfsQ

.

front

(

)

.

first

;

int

curY

=

bfsQ

.

front

(

)

.

second

;

bfsQ

.

pop

(

)

;

int

dx

[

4

]

=

{

0

,

1

,

0

,

-

1

}

;

int

dy

[

4

]

=

{

1

,

0

,

-

1

,

0

}

;

for

(

int

k

=

0

;

k

<

4

;

k

++

)

{

int

newX

=

curX

+

dx

[

k

]

;

int

newY

=

curY

+

dy

[

k

]

;

if

(

newX

<

0

||

newX

>=

N

||

newY

<

0

||

newY

>=

M

)

{

continue

;

}

if

(

arr

[

newX

]

[

newY

]

==

'*'

&&

!

isVisit

[

newX

]

[

newY

]

)

{

bfsQ

.

push

(

make_pair

(

newX

,

newY

)

)

;

isVisit

[

newX

]

[

newY

]

=

true

;

}

}

}

}

}

}

cout

<<

ans

<<

"\n"

;

return

0

;

}