-
Notifications
You must be signed in to change notification settings - Fork 1
/
Copy path17679-프렌즈4블록.py
62 lines (51 loc) · 1.57 KB
/
17679-프렌즈4블록.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
55
56
57
58
59
60
61
62
global answer, nor, noc
answer = 0
def solution(m, n, board):
global answer, nor, noc
nor = m
noc = n
board = [list(r) for r in board]
recursive(board)
answer = get_answer(board)
return answer
def recursive(board):
rec = False
for i in range(nor-1):
for k in range(noc-1):
spot = board[i][k][0]
if spot != "_" and (spot == board[i][k+1][0] and spot == board[i+1][k][0] and spot == board[i+1][k+1][0]):
mark__(board, i, k)
rec = True
fall(board)
if(rec):
recursive(board)
return
def mark__(board, left_top_row, left_top_col):
board[left_top_row][left_top_col] += '_'
board[left_top_row][left_top_col+1] += '_'
board[left_top_row+1][left_top_col] += '_'
board[left_top_row+1][left_top_col+1] += '_'
def fall(board):
global answer
for i in range(nor-2, -1, -1):
for k in range(noc):
if "_" in board[i+1][k]:
target_row = -1
for t in range(i, -1, -1):
if "_" not in board[t][k]:
target_row = t
(board[target_row][k], board[i+1][k]
) = (board[i+1][k], board[target_row][k])
break
for i in range(nor):
for k in range(noc):
if len(board[i][k]) != 1:
answer += 1
board[i][k] = "_"
def get_answer(board):
answer = 0
for row in board:
for e in row:
if e == "_":
answer += 1
return answer