-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy path25.방의 크기구하기.py
More file actions
50 lines (40 loc) · 1.24 KB
/
25.방의 크기구하기.py
File metadata and controls
50 lines (40 loc) · 1.24 KB
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
from collections import deque
from statsmodels.graphics.tukeyplot import results
dx=[-1,1,0,0]
dy=[0,0,-1,1]
def bfs(start_x,start_y,grid,visited,h,w):
queue=deque()
queue.append((start_x,start_y))
visited[start_x][start_y]=True
room_size=1
while queue:
x,y=queue.popleft()
for dir in range(4):
nx,ny=x+dx[dir],y+dy[dir]
if 0<=nx<h and 0<=ny<w:
if not visited[nx][ny] and grid[nx][ny]=='.':
visited[nx][ny]=True
queue.append((nx,ny))
room_size+=1
return room_size
def solve_case(grid,h,w):
visited=[[False]*w for i in range(h)]
room_size=[]
for i in range(h):
for j in range(w):
if grid[i][j]=='.'and not visited[i][j]:
size=bfs(i,j,grid,visited,h,w)
room_size.append(size)
room_size.sort(reverse=True)
return room_size
result=[]
if __name__ == "__main__":
T = int(input())
for i in range(T):
w,h=map(int,input().split())
grid=[list(input().strip())for j in range(h)]
sizes=solve_case(grid,h,w)
result.append(sizes)
for sizes in result:
print(len(sizes))
print(" ".join(map(str,sizes)))