알고리즘 풀이/백준
[백준][Java] 1080번 행렬 (그리디)
배게
2021. 9. 11. 10:20
728x90
for문 깊을 때는 함수로 빼서 처리해야되는데 그냥 귀찮아서 4중 for문씀
|
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
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
|
import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.OutputStreamWriter;
public class Main {
private static BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
private static BufferedWriter bw = new BufferedWriter(new OutputStreamWriter(System.out));
public static void main(String[] args) throws IOException{
String[] str = br.readLine().split(" ");
int N = Integer.parseInt(str[0]);
int M = Integer.parseInt(str[1]);
int[][] A = new int[N][M];
int[][] B = new int[N][M];
for(int i=0; i<N; i++) {
char[] input = br.readLine().toCharArray();
for(int j=0; j<M; j++) {
A[i][j] = input[j]-'0';
}
}
for(int i=0; i<N; i++) {
char[] input = br.readLine().toCharArray();
for(int j=0; j<M; j++) {
B[i][j] = input[j]-'0';
}
}
// for (int i = 0; i < B.length; i++) {
// for (int j = 0; j < B[0].length; j++) {
// System.out.print(A[i][j]);
// }
// System.out.println();
// }
int res = 0;
for(int i=0; i<N-2; i++) {
for(int j=0; j<M-2; j++) {
if(A[i][j]!=B[i][j]) {
res++;
for(int k=i; k<i+3 ;k++) {
for(int l=j; l<j+3; l++) {
if(A[k][l]==1) A[k][l]=0;
else A[k][l]=1;
}
}
}
}
}
for(int i=0; i<N; i++) {
for(int j=0; j<M; j++) {
if(A[i][j]!=B[i][j]) {
System.out.println(-1);
return;
}
}
}
System.out.println(res);
// System.out.println();
// for (int i = 0; i < B.length; i++) {
// for (int j = 0; j < B[0].length; j++) {
// System.out.print(A[i][j]);
// }
// System.out.println();
// }
// bw.write("");
// bw.flush();
// bw.close();
}
}
|
cs |