Submission #70983459

---

Source Code Expand

n, X, Y = map(int, input().split())
Q = [tuple(input().split()) for _ in range(n)]

A = {(0, X-1, 0, Y-1)}
for m, a, b in Q:
  a, b = int(a), int(b)
  A_ = set()
  if m=='Y':
    for g in A:
      xl, xr, yl, yr = g
      if yr<a:
        A_.add((xl-b, xr-b, yl, yr))
      elif yl>=a:
        A_.add((xl+b, xr+b, yl, yr))
      else:
        A_.add((xl-b, xr-b, yl, a-1))
        A_.add((xl+b, xr+b, a, yr))
  else:
    for g in A:
      xl, xr, yl, yr = g
      if xr<a:
        A_.add((xl, xr, yl-b, yr-b))
      elif xl>=a:
        A_.add((xl, xr, yl+b, yr+b))
      else:
        A_.add((xl, a-1, yl-b, yr-b))
        A_.add((a, xr, yl+b, yr+b))
  A = A_

xs = set()
ys = set()
for xl, xr, yl, yr in A:
  xs.add(xl)
  xs.add(xr+1)
  ys.add(yl)
  ys.add(yr+1)

xs = sorted(xs)
ys = sorted(ys)

XI = {x:i for i, x in enumerate(xs)}
YI = {x:i for i, x in enumerate(ys)}

lx, ly = len(XI), len(YI)
D = [[0]*ly for _ in range(lx)]
# print(A, xs, ys)
for xl, xr, yl, yr in A:
  for i in range(lx):
    for j in range(ly):
      if xl<=xs[i]<=xr and yl<=ys[j]<=yr:
        D[i][j] = (xs[i+1]-xs[i])*(ys[j+1]-ys[j])

# print(D)

def dfs(sx, sy):
  global ans
  que = [(sx, sy)]
  ans += D[sx][sy]
  D[sx][sy] = 0
  for x, y in que:
    for dx, dy in (0, 1), (1, 0), (0, -1), (-1, 0):
      nx, ny = x+dx, y+dy
      if 0<=nx<lx and 0<=ny<ly and D[nx][ny]:
        ans += D[nx][ny]
        D[nx][ny] = 0
        que.append((nx, ny))



A = []
for i in range(lx):
  for j in range(ly):
    if D[i][j]:
      ans = 0
      dfs(i, j)
      A.append(ans)

A.sort()
print(len(A))
print(*A)


  

Submission Info

Judge Result