-
Notifications
You must be signed in to change notification settings - Fork 0
/
Main17140.java
155 lines (127 loc) · 3 KB
/
Main17140.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
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.HashMap;
import java.util.HashSet;
import java.util.LinkedList;
import java.util.PriorityQueue;
import java.util.Queue;
import java.util.StringTokenizer;
public class Main17140 {
static int r,c,k,result=0;
public static void main(String[] args) throws NumberFormatException, IOException {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
StringTokenizer st = new StringTokenizer(br.readLine());
r = Integer.parseInt(st.nextToken());
c = Integer.parseInt(st.nextToken());
k = Integer.parseInt(st.nextToken());
int[][] map = new int[3][3];
for(int i=0;i<3;i++) {
st = new StringTokenizer(br.readLine());
for(int j=0;j<3;j++) {
map[i][j] = Integer.parseInt(st.nextToken());
}
}
if(r-1<3 && c-1<3 && map[r-1][c-1] ==k) {
System.out.println(0);
}else {
solve(map,1,3,3);
System.out.println(result);
}
PriorityQueue<Node> pq = new PriorityQueue<>();
}
static void solve(int[][] map,int idx,int rCnt,int cCnt) {
if(idx>100) {
result = -1;
return;
}
int[][] newMap = new int[100][100];
if(rCnt>=cCnt) {
//r
int cnt=0;
for(int i=0;i<rCnt;i++) {
PriorityQueue<Node> pq = new PriorityQueue<>();
HashMap<Integer,Integer> hm = new HashMap<>();
for(int j=0;j<map[i].length;j++) {
if(map[i][j] == 0) {
continue;
}
if(hm.containsKey(map[i][j])) {
hm.put(map[i][j],hm.get(map[i][j])+1);
}else {
hm.put(map[i][j], 1);
}
}
for(int temp : hm.keySet()) {
pq.offer(new Node(temp,hm.get(temp)));
}
int j=0;
while(!pq.isEmpty()) {
Node n = pq.poll();
newMap[i][j]=n.n;
newMap[i][j+1]=n.c;
j+=2;
if(j>100) {
j=100;
break;
}
}
cnt = cnt>j?cnt:j;
}
cCnt = cnt;
}else {
//c
int cnt = 0;
for(int i=0;i<cCnt;i++) {
PriorityQueue<Node> pq = new PriorityQueue<>();
HashMap<Integer,Integer> hm = new HashMap<>();
for(int j=0;j<rCnt;j++) {
if(map[j][i] == 0) {
continue;
}
if(hm.containsKey(map[j][i])) {
hm.put(map[j][i],hm.get(map[j][i])+1);
}else {
hm.put(map[j][i], 1);
}
}
for(int temp : hm.keySet()) {
pq.offer(new Node(temp,hm.get(temp)));
}
int j=0;
while(!pq.isEmpty()) {
Node n = pq.poll();
newMap[j][i]=n.n;
newMap[j+1][i]=n.c;
j+=2;
if(j>100) {
j=100;
break;
}
}
cnt = cnt>j?cnt:j;
}
rCnt = cnt;
}
if(newMap[r-1][c-1] ==k ) {
result = idx;
}else {
solve(newMap,idx+1,rCnt,cCnt);
}
}
static class Node implements Comparable<Node>{
int n;
int c;
public Node(int n, int c) {
super();
this.n = n;
this.c = c;
}
@Override
public int compareTo(Node o) {
return this.c==o.c?this.n-o.n:this.c-o.c;
}
}
}