알고리즘 예제/Python

[Python] - Coding Test / 6097 문제

KimTory 2022. 3. 6. 21:45

✍ CodeUp 문제  / 출처 : Codeup

👉 Input

 

👉 Output

 

👉 Source Code

h, w = map(int, input().split())
n = int(input())
grid = [list(0 for _ in range(w)) for _ in range(h)]

for i in range(n):
    l , d, x, y = map(int, input().split())
    x -= 1
    y -= 1
    # 가로
    if d == 0:
        for j in range(l):
            grid[x][y + j] = 1
    else:
        for j in range(l):
            grid[x + j][y] = 1

for i in range(h):
    print(*grid[i]) # * 연산자 사용하여 list 형태 없애고 1개씩 출력