[SWEA 1868번] 파핑파핑 지뢰찾기 :: 늦깎이 IT

[SWEA 1868번 파핑파핑 지뢰찾기 URL]

[소스 코드]

import java.beans.Visibility;
import java.io.*;
import java.util.LinkedList;
import java.util.Queue;
import java.util.StringTokenizer;
 
public class Solution {
 
    public static int tCase, N, ans, click, mine, noClick;
    public static char[][] map;
    public static boolean[][] visited;
    public static int[] dirX = new int[] { 0, 0, -1, -1, -1, 1, 1, 1 };
    public static int[] dirY = new int[] { -1, 1, -1, 0, 1, -1, 0, 1 };
 
    public static Queue<Node> q = new LinkedList<Node>();
 
    public static void main(String[] args) throws Exception {
 
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        tCase = Integer.parseInt(br.readLine());
 
        for (int t = 1; t <= tCase; t++) {
 
            N = Integer.parseInt(br.readLine());
            map = new char[N][N];
            visited = new boolean[N][N];
            ans = click = mine = noClick = 0;
 
            for (int i = 0; i < N; i++) {
                String str = br.readLine();
                for (int j = 0; j < N; j++) {
                    map[i][j] = str.charAt(j);
                    if (map[i][j] == '*')
                        mine += 1;
                }
            }
            for (int i = 0; i < N; i++) {
                for (int j = 0; j < N; j++) {
 
                    if (map[i][j] != '*' && isPossible(i, j) && !visited[i][j]) {
                        solve(i, j);
                    }
                }
            }
            noClick = countNoCick();
            System.out.println("#" + t + " " + (click + noClick));
        }
    }
 
    public static int countNoCick() {
        int count = 0;
        for (int i = 0; i < N; i++) {
            for (int j = 0; j < N; j++) {
                if (!visited[i][j] && map[i][j] != '*')
                    count += 1;
            }
        }
        return count;
    }
 
    public static boolean isPossible(int row, int col) {
 
        for (int i = 0; i < 8; i++) {
 
            int nr = row + dirX[i];
            int nc = col + dirY[i];
 
            if (!isBoundary(nr, nc))
                continue;
 
            if (map[nr][nc] != '.')
                return false;
        }
 
        return true;
    }
 
    public static void solve(int row, int col) {
 
        q.clear();
        q.offer(new Node(row, col));
        click += 1;
 
        while (!q.isEmpty()) {
 
            Node node = q.poll();
            visited[node.row][node.col] = true;
 
            for (int i = 0; i < 8; i++) {
                int nr = node.row + dirX[i];
                int nc = node.col + dirY[i];
 
                if (isBoundary(nr, nc) && !visited[nr][nc]) {
                    visited[nr][nc] = true;
                    if (isPossible(nr, nc))
                        q.offer(new Node(nr, nc));
                }
            }
        }
    }
 
    public static boolean isBoundary(int row, int col) {
        return (row >= 0 && row < N) && (col >= 0 && col < N);
    }
}
 
class Node {
    int row;
    int col;
 
    public Node(int row, int col) {
        super();
        this.row = row;
        this.col = col;
    }
 
}