Algorithm-Baekjoon/1080.cpp at master · pertus123/Algorithm-Baekjoon · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
#include "stdafx.h"
int a[50][50];
int b[50][50];
int ans = 0;

void cmp(int x, int y) {
	for (int i = x - 1; i <= x + 1; i++) {
		for (int j = y - 1; j <= y + 1; j++) {
			a[i][j] = 1 - a[i][j];
		}
	}
}

int main() {

	int n, m;

	scanf("%d %d", &n, &m);

	for (int i = 0; i < n; i++)
		for (int j = 0; j < m; j++)
			scanf("%1d", &a[i][j]);
	for (int i = 0; i < n; i++)
		for (int j = 0; j < m; j++)
			scanf("%1d", &b[i][j]);

	for (int i = 0; i < n-2; i++) {
		for (int j = 0; j < m-2; j++) {
			if (a[i][j] != b[i][j]) {
				ans++;
				cmp(i + 1, j + 1);
			}
		}
	}

	for (int i = 0; i < n; i++)
		for (int j = 0; j < m; j++)
			if (a[i][j] != b[i][j])
				ans = -1;

	printf("%d\n", ans);

	return 0;
}