-
Notifications
You must be signed in to change notification settings - Fork 0
/
Main17140_2.java
106 lines (91 loc) · 2.36 KB
/
Main17140_2.java
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
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Comparator;
import java.util.StringTokenizer;
public class Main17140_2 {
public static void main(String[] args) throws NumberFormatException, IOException {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
StringTokenizer st = new StringTokenizer(br.readLine());
int r = Integer.parseInt(st.nextToken())-1;
int c = Integer.parseInt(st.nextToken())-1;
int k = Integer.parseInt(st.nextToken());
int[][] arr = new int[100][100];
for(int i=0;i<3;i++) {
st = new StringTokenizer(br.readLine());
for(int j=0;j<3;j++) {
arr[i][j] = Integer.parseInt(st.nextToken());
}
}
int rLen = 3,cLen = 3;
int time = 0;
while(arr[r][c] !=k && time<=100) {
int mLen=0;
time++;
if(rLen>=cLen) {
//행연산
for(int i=0;i<rLen;i++) {
int[][] tmp = new int[100+1][2];
for(int j=0;j<=100;j++) {
tmp[j][0] = j;
}
//count
for(int j=0;j<100;j++) {
if(arr[i][j] !=0) tmp[arr[i][j]][1]++;
}
Arrays.sort(tmp,new Comparator<int[]>() {
@Override
public int compare(int[] o1, int[] o2) {
return o1[1]==o2[1]?o1[0]-o2[0] :o1[1]-o2[1];
}
});
int idx = 0;
for(int j=0;j<101;j++) {
if(tmp[j][1] !=0) {
arr[i][idx++] = tmp[j][0];
arr[i][idx++] =tmp[j][1];
}
}
for(int j=idx;j<100;j++) {
arr[i][j] =0;
}
if(mLen<idx) mLen = idx;
}
if(cLen<mLen) cLen = mLen;
}else {
//열연산
for(int i=0;i<cLen;i++) {
int[][] tmp = new int[100+1][2];
for(int j=0;j<=100;j++) {
tmp[j][0] = j;
}
//count
for(int j=0;j<100;j++) {
if(arr[j][i] !=0) tmp[arr[j][i]][1]++;
}
Arrays.sort(tmp,new Comparator<int[]>() {
@Override
public int compare(int[] o1, int[] o2) {
return o1[1]==o2[1]?o1[0]-o2[0] :o1[1]-o2[1];
}
});
int idx = 0;
for(int j=0;j<101;j++) {
if(tmp[j][1] !=0) {
arr[idx++][i] = tmp[j][0];
arr[idx++][i] =tmp[j][1];
}
}
for(int j=idx;j<100;j++) {
arr[j][i] =0;
}
if(mLen<idx) mLen = idx;
}
if(rLen<mLen) rLen = mLen;
}
}
System.out.println(time>100?-1:time);
}
}