[ CodeUp ] Python 기초 100제 | 6097 번 풀이

 

 

 

 

codeup.kr/problem.php?id=6097

[기초-리스트] 설탕과자 뽑기(py)

 

 

 

 

 

 

 

 

[ 풀이 ]

 

 

 

h,w = map(int,input().split())
n = int(input())

board=[[0]*w for _ in range(h)]

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

for i in range(h):
    for j in range(w):
        print(board[i][j],end=' ')
    print()