Java版PAT甲级1091

https://pintia.cn/problem-sets/994805342720868352/problems/994805375457411072
两组数据TLE,气死个人，Java给力点吧

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.LinkedList;
import java.util.StringTokenizer;

public class Main{
    static BufferedReader reader = new BufferedReader(new InputStreamReader(System.in));
    static int M, N, L, T;
    static boolean[][][] arr;
    static int[][] dir = new int[][]{
            {1, 0, 0},
            {-1, 0, 0},
            {0, 1, 0},
            {0, -1, 0},
            {0, 0, 1},
            {0, 0, -1},
    };

    public static void main(String[] args) throws IOException {
        String[] str = reader.readLine().split(" ");
        M = Integer.parseInt(str[0]);
        N = Integer.parseInt(str[1]);
        L = Integer.parseInt(str[2]);
        T = Integer.parseInt(str[3]);
        arr = new boolean[L][M][N];
        for (int i = 0; i < L; i++) {
            for (int j = 0; j < M; j++) {
                str = reader.readLine().split(" ");
                for (int k = 0; k < N; k++) {
                     if(str[k].charAt(0) == '1') arr[i][j][k] = true;
                }
            }
        }
        int res = 0;
        for (int i = 0; i < L; i++) {
            for (int j = 0; j < M; j++) {
                for (int k = 0; k < N; k++) {
                    if (arr[i][j][k]) {
                        int t = bfs(i, j, k);
                        if (t >= T) res += t;
                    }
                }
            }
        }
        System.out.println(res);
    }

    private static int bfs(int i, int j, int k) {
        LinkedList<int[]> nodes = new LinkedList<>();
        nodes.offer(new int[]{i, j, k});
        arr[i][j][k] = false;
        int count = 1;
        int[] temp;
        while (!nodes.isEmpty()) {
            temp = nodes.poll();
            for (int l = 0; l < 6; l++) {
                int dx = temp[0] + dir[l][0];
                int dy = temp[1] + dir[l][1];
                int dz = temp[2] + dir[l][2];
                if (dx >= 0 && dx < L && dy >= 0 && dy < M && dz >= 0 && dz < N && arr[dx][dy][dz]) {
                    arr[dx][dy][dz] = false;
                    count++;
                    nodes.offer(new int[]{dx, dy, dz});
                }
            }
        }
        return count;
    }
}