백준 10026번 적록색약 [ Java ]

10026번: 적록색약

각각 따로 BFS를 돌려주었습니다.

import java.util.*;
import java.io.*;

public class Main {

    public static void main(String[] args) throws IOException{
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        int[] dx = new int[]{1, 0, -1 ,0};
        int[] dy = new int[]{0, 1, 0, -1};
        int[] result = new int[2];
        int N = Integer.parseInt(br.readLine());
        String[][] painting = new String[N][N];
        boolean[][] visited1 = new boolean[N][N];
        boolean[][] visited2 = new boolean[N][N];
        for (int i=0; i<N; i++)
            painting[i] = br.readLine().split("");

        for (int i=0; i<N; i++){
            // 적록색약 아닌사람
            for (int j=0; j<N; j++){
                // 방문했으면 지나갑니다,,
                if (visited1[i][j]) continue;
                result[0]++;
                // BFS를 돌릴 현재 위치가 무슨 색인지
                String curColor = painting[i][j];
                Queue<int[]> Q = new LinkedList<>();
                Q.offer(new int[]{i, j});
                visited1[i][j] = true;
                while (!Q.isEmpty()){
                    int[] cur = Q.poll();
                    for (int dir=0; dir<4; dir++){
                        int nx = cur[1] + dx[dir];
                        int ny = cur[0] + dy[dir];
                        if (nx<0 || nx>=N || ny<0 || ny>=N) continue;
                        if (visited1[ny][nx] || !painting[ny][nx].equals(curColor)) continue;
                        visited1[ny][nx] = true;
                        Q.offer(new int[]{ny, nx});
                    }
                }
            }
            // 적록색약인 사람
            for (int j=0; j<N; j++){
                // 방문했으면 지나갑니다,,
                if (visited2[i][j]) continue;
                result[1]++;
                // BFS를 돌릴 현재 위치가 무슨 색인지
                String curColor = painting[i][j];
                Queue<int[]> Q = new LinkedList<>();
                Q.offer(new int[]{i, j});
                visited2[i][j] = true;
                while (!Q.isEmpty()){
                    int[] cur = Q.poll();
                    for (int dir=0; dir<4; dir++){
                        int nx = cur[1] + dx[dir];
                        int ny = cur[0] + dy[dir];
                        if (nx<0 || nx>=N || ny<0 || ny>=N) continue;
                        if (visited2[ny][nx]) continue;
                        if (curColor.equals("R") || curColor.equals("G"))
                            if (painting[ny][nx].equals("B")) continue;
                        if (curColor.equals("B") && !painting[ny][nx].equals("B")) continue;
                        visited2[ny][nx] = true;
                        Q.offer(new int[]{ny, nx});
                    }
                }
            }
        }
        System.out.print(result[0] + " " + result[1]);
    }
}