백준 : 17140

https://www.acmicpc.net/problem/17140

17140번: 이차원 배열과 연산

 

import java.io.*;
import java.util.*;
 
import jdk.nashorn.internal.runtime.arrays.ArrayLikeIterator;
 
public class Main {
    static int r, c, k;
    static int[][] arr;
    static int cnt = 0;
 
    public static class A implements Comparable<A> {
 
        int v;
        int cnt;
 
        A(int v, int cnt) {
            this.v = v;
            this.cnt = cnt;
        }
 
        @Override
        public int compareTo(A o) {
            // TODO Auto-generated method stub
            if (this.cnt > o.cnt) {
                return 1;
            } else if (this.cnt == o.cnt) {
                if (this.v > o.v) {
                    return 1;
                } else {
                    return -1;
                }
            } else {
                return -1;
            }
        }
    }
 
    public static void main(String[] args) throws IOException {
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        BufferedWriter bw = new BufferedWriter(new OutputStreamWriter(System.out));
        StringTokenizer st;
 
        st = new StringTokenizer(br.readLine());
 
        r = Integer.parseInt(st.nextToken());
        c = Integer.parseInt(st.nextToken());
        k = Integer.parseInt(st.nextToken());
        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 R = 3;
        int C = 3;
 
        while (true) {
//            System.out.println("R , C : " + R + " " + C);
            if (cnt > 100) {
                bw.write(-1 + "");
                bw.flush();
                break;
            } else if (arr[r - 1][c - 1] == k && r <= R && c <= C) {
                bw.write(cnt + "");
                bw.flush();
                break;
            }
            //
 
            if (R >= C) {
                // 행검사
                int tmp = 0;
                for (int i = 0; i < R; i++) {
                    ArrayList<A> myArray = new ArrayList<A>();
                    for (int j = 0; j < C; j++) {
                        // Array에 몇번째에 있는지
                        if (arr[i][j] == 0)
                            continue;
                        int look = -1;
                        for (int k = 0; k < myArray.size(); k++) {
                            if (myArray.get(k).v == arr[i][j]) {
                                look = k;
                            }
                        }
                        if (look == -1) {
                            myArray.add(new A(arr[i][j], 1));
                        } else {
                            myArray.set(look, new A(arr[i][j], myArray.get(look).cnt + 1));
                        }
                    }
                    // 정렬하면됨 카운트 기준 오름차순
                    Collections.sort(myArray);
//                    System.out.println(i + 1 + "행정렬");
//                    for (int myNum = 0; myNum < myArray.size(); myNum++) {
//                        System.out.printf("%d %d ", myArray.get(myNum).v, myArray.get(myNum).cnt);
//                    }
//                    System.out.println();
 
                    // 초기화
 
                    for (int j = 0; j < C; j++) {
                        arr[i][j] = 0;
                    }
 
                    int set = 0;
                    for (int myNum = 0; myNum < myArray.size(); myNum++) {
                        arr[i][set++] = myArray.get(myNum).v;
                        arr[i][set++] = myArray.get(myNum).cnt;
                    }
 
                    if (tmp < set) {
                        tmp = set;
                    }
 
                }
                C = tmp;
            } else {
                // 열검사
                int tmp = 0;
                for (int j = 0; j < C; j++) {
                    ArrayList<A> myArray = new ArrayList<A>();
                    for (int i = 0; i < R; i++) {
                        // Array에 몇번째에 있는지
                        if (arr[i][j] == 0)
                            continue;
                        int look = -1;
                        for (int k = 0; k < myArray.size(); k++) {
                            if (myArray.get(k).v == arr[i][j]) {
                                look = k;
                            }
                        }
                        if (look == -1) {
                            myArray.add(new A(arr[i][j], 1));
                        } else {
                            myArray.set(look, new A(arr[i][j], myArray.get(look).cnt + 1));
                        }
                    }
                    // 정렬하면됨 카운트 기준 오름차순
                    Collections.sort(myArray);
 
                    for (int i = 0; i < R; i++) {
                        arr[i][j] = 0;
                    }
 
                    int set = 0;
//                    System.out.println(j + 1 + "열정렬");
//                    for (int myNum = 0; myNum < myArray.size(); myNum++) {
//                        System.out.printf("%d %d ", myArray.get(myNum).v, myArray.get(myNum).cnt);
//                    }
//                    System.out.println();
                    for (int myNum = 0; myNum < myArray.size(); myNum++) {
                        arr[set++][j] = myArray.get(myNum).v;
                        arr[set++][j] = myArray.get(myNum).cnt;
                    }
                    if (set > tmp) {
                        tmp = set;
                    }
 
                }
                R = tmp;
                //
            }
 
            cnt++;
        }
 
    }
}