Submission #76711958

---

Source Code Expand

h, w, q = map(int, input().split())
s = [list(input()) for i in range(h)]

# x = [[0]*(w+1) for i in range(h+1)]
cnt = 0
def bounded(i, j):
  return 0 <= i and i < h and 0 <= j and j < w
def is_road(i, j):
  return s[i][j] == "R"
def judge(i, j):
  if not bounded(i, j):
    return False
  if bounded(i+1, j) and is_road(i+1, j):
    return True
  if bounded(i-1, j) and is_road(i-1, j):
    return True
  if bounded(i, j+1) and is_road(i, j+1):
    return True
  if bounded(i, j-1) and is_road(i, j-1):
    return True
  return False
for i in range(h):
  for j in range(w):
    if s[i][j] == "B" and judge(i, j):
      cnt += 1
      s[i][j] = "E"
# print(s[1][0], s[1][1], judge(i, j), is_road(1, 0), bounded(1, 0))
for i in range(q):
  u, d, l, r = map(int, input().split())
  u -= 1
  d -= 1
  l -= 1
  r -= 1
  # print(cnt)
  for j in range(d-u+1):
    if l-1 >= 0 and s[u+j][l-1] == "B":
      cnt += 1
      s[u+j][l-1] = "E"
    if r+1 < w and s[u+j][r+1] == "B":
      cnt += 1
      s[u+j][r+1] = "E"
      # print(i)
  for j in range(r-l+1):
    if u-1 >= 0 and s[u-1][l+j] == "B":
      cnt += 1
      s[u-1][l+j] = "E"
      # print("!")
    if d+1 < h and s[d+1][l+j] == "B":
      cnt += 1
      s[d+1][l+j] = "E"
      # print("?")
  print(cnt)

Submission Info

Judge Result