1091 Acute Stroke (30 分)--python

牛客上倒是过了，PTA上给我来俩超时，我是笨逼

m, n, l, t = [int(x) for x in input().split()]
project = []
for i in range(l):
    d = []
    for j in range(m):
        d.append(list(map(int, input().split())))
    project.append(d)
count = 0

# print(project)

dx = [-1, 1, 0, 0, 0, 0]
dy = [0, 0, -1, 1, 0, 0]
dz = [0, 0, 0, 0, -1, 1]


def bfs(a1, b1, c1):
    index = 1
    global project
    global count
    q = [[a1, b1, c1]]
    project[a1][b1][c1] = 0
    while len(q) != 0:
        a1 = q[0][0]
        b1 = q[0][1]
        c1 = q[0][2]
        del q[0]
        for x in range(6):
            newc = c1 + dx[x]
            newb = b1 + dy[x]
            newa = a1 + dz[x]
            if newc < 0 or newc >= n or newb < 0 or newb >= m or newa < 0 or newa >= l:
                continue
            if project[newa][newb][newc] == 0:
                continue
            index += 1
            project[newa][newb][newc] = 0
            q.append([newa, newb, newc])
    if index >= t:
        count += index
    return


for i in range(l):
    for j in range(m):
        for k in range(n):
            if project[i][j][k] == 1:
                bfs(i, j, k)

print(count)