DDDC 2020 예선 C-strawberry Cakes 해설 [pyhon]

URL

문제 개요

코드 커밋

#!/usr/bin/env python3
h, w, k = map(int, input().split())
s = []
for i in range(h):
    s.append(input())
out = [[0] * w for _ in range(h)]
idx = 0
for i in range(h):
    first_pos = -1
    first_idx = 0
    for j in range(w):
        if s[i][j] == "#":
            idx += 1
            out[i][j] = idx
            if first_pos == -1:
                first_pos = j
                first_idx = idx
        else:
            if first_pos != -1:
                out[i][j] = idx
    for j in range(first_pos):
        out[i][j] = first_idx
for i in range(h):
    for j in range(w):
        if i == 0:
            continue
        else:
            if out[i][j] == 0:
                out[i][j] = out[i - 1][j]
for i in range(h - 1, -1, -1):
    for j in range(w):
        if i == h - 1:
            continue
        else:
            if out[i][j] == 0:
                out[i][j] = out[i + 1][j]
for i in range(h):
    print(*out[i])

고찰하다.

실시 방침

메모지

참고 자료