백준 16116. 작은 큐브러버 :: 돼지개발자

출저 : https://www.acmicpc.net/problem/16116

"문제를 단순화 해보자..."

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.StringTokenizer;
 
public class Main {
 
    static char[][] map = new char[8][3];
    static int[][] d1 = {{0,1},{1,2},{2,0}};
    static int[][] d2 = {{0,2},{1,0},{2,1}};
    static boolean ok = true;
    
    public static void main(String[] args) throws IOException {
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        
        for (int i = 0; i < 8; i++) {
            StringTokenizer st = new StringTokenizer(br.readLine());
            for (int j = 0; j < 3; j++) {
                map[i][j] = st.nextToken().charAt(0);
            }
        }
        
        for (int i = 0; i < 8; i++) {
            for (int j = 0; j < 3; j++) {
                char a = map[i][d1[j][0]];
                char b = map[i][d1[j][1]];
                
                if(solve(a,b,i) != 1) 
                    ok = false;
            }
            if(!ok) break;
        }
        System.out.println(ok ? "YES" : "NO");
    }
    
    static int solve(char a, char b, int idx) {
        int cnt = 0;
        for (int i = 0; i < 8; i++) {
            if(i == idx) continue;
            
            for (int j = 0; j < 3; j++) {
                char na = map[i][d2[j][0]];
                char nb = map[i][d2[j][1]];
                
                if(a == na && b == nb) {
                    cnt++;
                }
            }
        }
        return cnt;
    }
}