Submission #69075543

---

Source Code Expand

n, q = map(int, input().split())

s = [list(input()) for _ in range(n)]

def is_ok(i, j):
    return s[i][j] == "." and s[i+1][j] == "." and s[i][j+1] == "." and s[i+1][j+1] == "."

t = [[0 for _ in range(n)] for _ in range(n)]

for i in range(1, n):
    for j in range(1, n):
        t[i][j] = t[i][j-1] + t[i-1][j] - t[i-1][j-1]

        if is_ok(i - 1, j - 1):
            t[i][j] += 1

for _ in range(q):
    u, d, l, r = map(lambda x: int(x)-1, input().split())
    print(t[d][r] + t[u][l] - t[d][l] - t[u][r])

Submission Info

Judge Result