[백준] Q10026 적록색약(java)

dfs알고리즘을 이용해 풀었다.

 

 

import java.util.Scanner;
 
public class Q10026_1{
    static char[][] map;
    static int[][] visit1;
    static int[][] visit2;
    static int[] x = {-1,0,1,0};
    static int[] y = {0,1,0,-1};
    static int N;
    public static void main(String[] args) {
        Scanner scan = new Scanner(System.in);
        N = Integer.parseInt(scan.nextLine());
        map = new char[N][N]; 
        for(int i=0; i<N; i++){
            String temp = scan.nextLine();
            //System.out.println(temp);
            for(int j=0; j<N; j++){
                map[i][j] = temp.charAt(j);
            }    
        }
 
        int part1 =0;
        int part2 =0;
 
        visit1 = new int[N][N];
        visit2 = new int[N][N];
 
        for(int i=0 ;i<N; i++){
            for(int j=0; j<N; j++){
                if(visit1[i][j] == 0){
                    dfs1(i,j);
                    part1++;
                }
            }
        }
 
        for(int i=0 ;i<N; i++){
            for(int j=0; j<N; j++){
                if(visit2[i][j] == 0){
                    dfs2(i,j);
                    part2++;
                }
            }
        }
 
        System.out.println(part1);
        System.out.println(part2);
 
    }
 
 
 
public static void dfs1(int i, int j){
    char c = map[i][j];
    for(int k=0; k<4; k++){
        int ni = i +x[k];
        int nj = j + y[k];
         if(ni>=0 && ni<N && nj>=0 && nj<N){
            if(c == map[ni][nj] && visit1[ni][nj]==0){
                visit1[ni][nj] = 1;
                dfs1(ni,nj);
            }
        }
    }
}
 
//red-green blind
public static void dfs2(int i, int j){
    char c = map[i][j];
    for(int k=0; k<4; k++){
        int ni = i +x[k];
        int nj = j + y[k];
         if(ni>=0 && ni<N && nj>=0 && nj<N){
            if(c == 'B'){
                if(c == map[ni][nj] && visit2[ni][nj]==0){
                    visit2[ni][nj] = 1;
                    dfs2(ni,nj);
                }
            }else{
                if((map[ni][nj] == 'R' || map[ni][nj] == 'G') && visit2[ni][nj]==0){
                    visit2[ni][nj] = 1;
                    dfs2(ni,nj);
                }
            }
        }
    }
}
 
}