[Baekjoon-Python] 20061 : 모노미노도미노 2

https://www.acmicpc.net/problem/20061

접근

새로운 행은 앞에서 추가되고 0, 1행에 블록이 존재할 때 뒤부터 삭제되기 때문에 데큐를 사용한다.
blue는 x를 열로 두고 green과 같이 진행한다.
열이 가득 찬 행을 먼저 삭제하고 0, 1행을 확인한다.

풀이

from sys import stdin
from collections import deque


def find_top(board, c): # (1)
    for r in range(2, 6): # (2)
        if board[r][c] == 1:
            return r - 1
    return 5


def remove_full_col():
    global res
    for board in blue, green:
        for r in range(2, 6):
            if sum(board[r]) == 4: # (3)
                del board[r]
                board.appendleft([0] * 4)
                res += 1


def execute_special(): # (4)
    for board in blue, green:
        while 1 in board[1]:
            board.pop()
            board.appendleft([0] * 4)


n = int(stdin.readline())
blue = deque([[0] * 4 for _ in range(6)])
green = deque([[0] * 4 for _ in range(6)])
res = 0
for _ in range(n):
    t, r, c = map(int, stdin.readline().split())
    br, gr = find_top(blue, r), find_top(green, c) # (5)
    if t == 2:
        gr = min(gr, find_top(green, c + 1)) # (6)
        blue[br - 1][r], green[gr][c + 1] = 1, 1
    elif t == 3:
        br = min(br, find_top(blue, r + 1)) # (7)
        blue[br][r + 1], green[gr - 1][c] = 1, 1
    blue[br][r], green[gr][c] = 1, 1
    remove_full_col()
    execute_special()

print(res)
print(sum(map(sum, blue)) + sum(map(sum, green)))