-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy path3187양치기꿍.py
55 lines (40 loc) · 1.07 KB
/
3187양치기꿍.py
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
import sys
from collections import deque
input = sys.stdin.readline
def bfs(r,c):
dr = [-1, 1, 0, 0]
dc = [0, 0, -1, 1]
queue.append([r,c])
visited[r][c] = True
v_cnt = 0
k_cnt = 0
while queue:
r,c = queue.popleft()
if graph[r][c] == 'v':
v_cnt += 1
elif graph[r][c] == 'k':
k_cnt += 1
for i in range(4):
nr = r + dr[i]
nc = c + dc[i]
if 0 <= nr < M and 0 <= nc < N:
if graph[nr][nc] != '#' and not visited[nr][nc]:
visited[nr][nc] = True
queue.append([nr,nc])
if v_cnt >= k_cnt:
k_cnt = 0
else:
v_cnt = 0
return [v_cnt, k_cnt]
M,N = map(int, input().split())
graph = [list(input().strip()) for _ in range(M)]
visited = [[False] * N for _ in range(M)]
queue = deque()
v, k = 0,0
for i in range(M):
for j in range(N):
if graph[i][j] != '#' and not visited[i][j]:
v_cnt, k_cnt = bfs(i, j)
v += v_cnt
k += k_cnt
print(k, v)