행렬 풀이

문제 링크: https://www.acmicpc.net/problem/1080

백준 알고리즘 중급 1/3 710에서 4번째 - 1080번 행렬을 풀어보았다.

 

풀이: https://jokerldg.github.io/algorithm/2021/03/14/matrix.html

 

C++

 

Python

def reverse(x, y):
    for i in range(x, x+3):
        for j in range(y, y+3):
          A[i][j] = 1 - A[i][j]
def check():
  for i in range(N):
    for j in range(M):
      if A[i][j] != B[i][j]:
        return False
  return True

N, M = map(int, input().split())
A = [list(map(int,list(input()))) for _ in range(N)]
B = [list(map(int,list(input()))) for _ in range(N)]
count = 0
for i in range(N-2):
  for j in range(M-2):
    if A[i][j] != B[i][j]:
      reverse(i, j)
      count += 1
if check():
  print(count)
else:
  print("-1")

Java