48. 1303번 전쟁-전투

https://www.acmicpc.net/problem/1303

1303번: 전쟁 - 전투

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

//1303
public class training11 {
    public static String[][] map;
    public static boolean[][] visited;
    public static int N, M, cnt;
    public static int[] result = { 0, 0 };
    public static int[] dx = { 0, 1, 0, -1 };
    public static int[] dy = { 1, 0, -1, 0 };

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

        N = Integer.parseInt(st.nextToken());
        M = Integer.parseInt(st.nextToken());

        map = new String[N][M];
        visited = new boolean[N][M];
        for (int i = 0; i < N; i++) {
            String string = br.readLine();
            for (int j = 0; j < string.length(); j++) {
                String[] split = string.split("");
                map[i][j] = split[j];
            }
        }

        for (int i = 0; i < N; i++) {
            for (int j = 0; j < M; j++) {
                if (!visited[i][j]) {
                    cnt = 0;
                    dfs(i, j);
                    if (map[i][j].equals("W")) {
                        result[0] = result[0] + (cnt * cnt);
                    }
                    if (map[i][j].equals("B")) {
                        result[1] += cnt * cnt;
                    }
                }
            }
        }
        System.out.println(result[0] + " " + result[1]);

        // for(int k=0; k<M; k++){
        // System.out.println(Arrays.toString(map[k]));
        // }
    }

    public static void dfs(int width, int height) {
        visited[width][height] = true;
        cnt++;
        for (int i = 0; i < 4; i++) {
            int nx = width + dx[i];
            int ny = height + dy[i];

            if (nx < 0 || ny < 0 || nx >= N || ny >= M) {
                continue;
            }

            if (!visited[nx][ny] && map[nx][ny].equals(map[width][height])) {
                visited[nx][ny] = true;
                dfs(nx, ny);
            }
        }
    }
}