백준 3184번 - 양(DFS)

 

 

▶코드

import javax.sound.sampled.Line;
import java.util.*;
import java.io.*;

public class Main {
    static int dx[] = {0, 0, -1, 1};
    static int dy[] = {-1, 1, 0, 0};
    static char range[][];
    static boolean visitied[][];
    static int R, C, wolf, sheep, wolf_ans, sheep_ans;

    public static void main(String[] args) throws IOException {
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        StringTokenizer st;
        st = new StringTokenizer(br.readLine());
        R = Integer.parseInt(st.nextToken());
        C = Integer.parseInt(st.nextToken());
        range = new char[R][C];
        visitied = new boolean[R][C];
        wolf = sheep = 0;
        for (int i = 0; i < R; i++) {
            String str = br.readLine();
            for (int j = 0; j < C; j++) {
                range[i][j] = str.charAt(j);
            }
        }
        for (int i = 0; i < R; i++) {
            for (int j = 0; j < C; j++) {
                if (!visitied[i][j] && range[i][j] != '#') {
                    dfs(i, j);
                    if(wolf >= sheep){
                        wolf_ans += wolf;
                    } else if(wolf < sheep){
                        sheep_ans += sheep;
                    } else{
                        wolf_ans += wolf;
                        sheep_ans += sheep;
                    }
                }
                wolf = sheep = 0;
            }
        }
        System.out.println(sheep_ans + " " + wolf_ans);

    }
    public static void dfs(int x, int y) {
        visitied[x][y] = true;
        if(range[x][y] == 'v'){
            wolf += 1;
        }
        else if(range[x][y] == 'o'){
            sheep += 1;
        }
        for (int i = 0; i < 4; i++) {
            int rx = dx[i] + x;
            int ry = dy[i] + y;
            if (rx >= 0 && ry >= 0 && rx < R && ry < C && !visitied[rx][ry] && range[rx][ry] != '#') {
                dfs(rx, ry);
            }
        }
    }
}