[코드업] 6096 바둑알 십자 뒤집기

📖 문제

https://codeup.kr/problem.php?id=6096

💻 코드

mlist=[]
for i in range(19):
    mlist.append([])
    for j in range(19):
        mlist[i].append(0)

for i in range(19):
    mlist[i]=list(map(int, input().split()))

n=int(input())

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

for i in range(19):
    for j in range(19):
        print(mlist[i][j], end=' ')
    print()

➕ 풀이

mlist=[]
for i in range(19):
    mlist.append([])
    for j in range(19):
        mlist[i].append(0)

for i in range(19):
    mlist[i]=list(map(int, input().split()))

• 바둑알이 깔려 있는 상황이 19 * 19 크기의 정수값으로 입력

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

• 입력된 좌표에 따라 뒤집기