[Java] 백준 - 10026번: 적록색약

10월 18일(수) - 그래프와 순회 (10026번)

10026번: 적록색약

ㅡㅡㅡㅡㅡㅡㅡㅡㅡㅡㅡㅡㅡㅡㅡㅡㅡㅡㅡㅡㅡㅡㅡㅡㅡㅡㅡㅡㅡㅡㅡㅡㅡㅡㅡㅡㅡㅡㅡㅡㅡㅡㅡㅡㅡㅡㅡㅡㅡㅡ

 

문제점

ㅡㅡㅡㅡㅡㅡㅡㅡㅡㅡㅡㅡㅡㅡㅡㅡㅡㅡㅡㅡㅡㅡㅡㅡㅡㅡㅡㅡㅡㅡㅡㅡㅡㅡㅡㅡㅡㅡㅡㅡㅡㅡㅡㅡㅡㅡㅡㅡㅡㅡ

 

풀이

(C언어 풀이 활용)

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;

public class Main {
    static int N;

    static String str;
    static char[][] arr;
    static int[][] visited;
    static int dx[] = {-1, 1, 0, 0};
    static int dy[] = {0, 0, -1, 1};

    public static void main(String[] args) throws IOException{
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));

        N = Integer.parseInt(br.readLine());
        arr = new char[N+1][N+1];
        visited = new int[N+1][N+1];

        for(int i=0; i<N; i++)
        {
            str = br.readLine();

            for(int j=0; j<N; j++)
            {
                arr[i][j] = str.charAt(j);
            }
        }

        for(int i=0; i<N; i++)
        {
            for(int j=0; j<N; j++)
            {
                if(arr[i][j] == 'R')
                {
                    arr[i][j] = 1;
                }
                else if(arr[i][j] == 'G')
                {
                    arr[i][j] = 2;
                }
                else
                {
                    arr[i][j] = 3;
                }
            }
        }

        int red = 0;
        int green = 0;
        int blue = 0;
        int red_green = 0;

        for(int i=0; i<N; i++)
        {
            for(int j=0; j<N; j++)
            {
                if(arr[i][j] == 1 && visited[i][j] == 0)
                {
                    dfs(i,j,1);
                    red++;
                }
                if(arr[i][j] == 2 && visited[i][j] == 0)
                {
                    dfs(i,j,2);
                    green++;
                }
                if(arr[i][j] == 3 && visited[i][j] == 0)
                {
                    dfs(i,j,3);
                    blue++;
                }
            }
        }

        for(int i=0; i<N; i++)
        {
            for(int j=0; j<N; j++)
            {
                visited[i][j] = 0;
            }
        }

        for(int i=0; i<N; i++)
        {
            for(int j=0; j<N; j++)
            {
                if((arr[i][j] == 1 || arr[i][j] == 2) && visited[i][j] == 0)
                {
                    red_green_blind(i, j);
                    red_green++;
                }
            }
        }

        int normal = red + green + blue;
        int blind = red_green + blue;
        System.out.print(normal + " " + blind);
    }

    static void dfs(int y, int x, int color){
        visited[y][x] = 1;

        for(int i=0; i<4; i++)
        {
            int next_x = x + dx[i];
            int next_y = y + dy[i];

            if(next_x<0 || next_y<0 || next_x>=N || next_y>= N)
            {
                continue;
            }
            if(arr[next_y][next_x] == color && visited[next_y][next_x] == 0)
            {
                dfs(next_y, next_x, color);
            }
        }
    }

    static void red_green_blind(int y, int x){
        visited[y][x] = 1;

        for(int i=0; i<4; i++)
        {
            int next_x = x + dx[i];
            int next_y = y + dy[i];

            if(next_x<0 || next_y<0 || next_x>=N || next_y>= N)
            {
                continue;
            }
            if((arr[next_y][next_x] == 1 || arr[next_y][next_x] == 2) && visited[next_y][next_x] == 0)
            {
                red_green_blind(next_y, next_x);
            }
        }
    }
}

ㅡㅡㅡㅡㅡㅡㅡㅡㅡㅡㅡㅡㅡㅡㅡㅡㅡㅡㅡㅡㅡㅡㅡㅡㅡㅡㅡㅡㅡㅡㅡㅡㅡㅡㅡㅡㅡㅡㅡㅡㅡㅡㅡㅡㅡㅡㅡㅡㅡㅡ