Submission #60529908

Source Code Expand

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
import java.util.*;
public class Main{
    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        int H = in.nextInt();
        int W = in.nextInt();
        int D = in.nextInt();
        in.nextLine();
        char[][] grid = new char[H][W];
        for (int i = 0; i < H; i++) {
            grid[i] = in.nextLine().toCharArray();
        }
        int[] dx = {0, 0, -1, 1};
        int[] dy = {-1, 1, 0, 0};
        boolean[][] see = new boolean[H][W];
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

import java.util.*;

public class Main{
    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);

        int H = in.nextInt();
        int W = in.nextInt();
        int D = in.nextInt();
        in.nextLine();

        char[][] grid = new char[H][W];
        for (int i = 0; i < H; i++) {
            grid[i] = in.nextLine().toCharArray();
        }

        int[] dx = {0, 0, -1, 1};
        int[] dy = {-1, 1, 0, 0};

        boolean[][] see = new boolean[H][W];

        Queue<int[]> queue = new LinkedList<>();

        for (int i = 0; i < H; i++) {
            for (int j = 0; j < W; j++) {
                if (grid[i][j] == 'H') {
                    queue.add(new int[]{i, j, 0}); 
                    see[i][j] = true;
                }
            }
        }

        int count = 0;




















        

        while (!queue.isEmpty()) {
            int[] cell = queue.poll();
            int x = cell[0];
            int y = cell[1];
            int len = cell[2];

            if (grid[x][y] == '.' || grid[x][y] == 'H') {
                count++;
                //grid[x][y] = '#';

            }
            if (len == D) continue;

            for (int k = 0; k < 4; k++) {
                int nx = x + dx[k];
                int ny = y + dy[k];

                if (nx >= 0 && nx < H && ny >= 0 && ny < W && !see[nx][ny] && grid[nx][ny] != '#') {
                    queue.add(new int[]{nx, ny,len + 1});
                    see[nx][ny] = true;
                }
            }
        }

        System.out.println(count);
    }
}

Submission Info

Judge Result