提出 #70980315

---

ソースコード 拡げる

class Rect
	def initialize x,y,w,h
		@x,@y,@w,@h = x,y,w,h
	end

	attr_reader :x,:y
	def right; @x+@w end
	def top; @y+@h end
	def area; @w*@h end

	def splitx x,b
		if @x+@w<=x
			@y -= b
			[self]
		elsif x<=@x
			@y += b
			[self]
		else
			r = Rect.new x,@y+b,@x+@w-x,@h
			@y -= b
			@w = x-@x
			[self,r]
		end
	end

	def splity y,b
		if @y+@h<=y
			@x -= b
			[self]
		elsif y<=@y
			@x += b
			[self]
		else
			r = Rect.new @x+b,y,@w,@y+@h-y
			@x -= b
			@h = y-@y
			[self,r]
		end
	end
end

N,X,Y = gets.split.map(&:to_i)
rs = [Rect.new(0,0,X,Y)]
N.times{
	c,*ab = gets.split
	case c
	when ?X
		x,b = ab.map(&:to_i)
		rs = rs.flat_map{|r| r.splitx(x,b) }
	when ?Y
		y,b = ab.map(&:to_i)
		rs = rs.flat_map{|r| r.splity(y,b) }
	end
}

Z = rs.map(&:area)
G = [-1]*rs.size
F = lambda{|a|
	G[a]<0 ? a : G[a] = F[G[a]]
}
U = lambda{|a,b|
	a,b = F[a],F[b]
	next if a==b
#warn [rs[a],rs[b]].inspect
	a,b = b,a if G[b]<G[a]
	Z[a] += Z[b]
	G[a] += G[b]
	G[b] = a
}
X2G = rs.size.times.group_by{|g| rs[g].x }
R2G = rs.size.times.group_by{|g| rs[g].right }
Y2G = rs.size.times.group_by{|g| rs[g].y }
T2G = rs.size.times.group_by{|g| rs[g].top }

rs.each_with_index{|r,g|
	if gs = X2G[r.right]
		gs.each{|g2|
			r2 = rs[g2]
			if r.top<=r2.y || r2.top<=r.y
			else
				U[g,g2]
			end
		}
	end
	if gs = R2G[r.x]
		gs.each{|g2|
			r2 = rs[g2]
			if r.top<=r2.y || r2.top<=r.y
			else
				U[g,g2]
			end
		}
	end
	if gs = Y2G[r.top]
		gs.each{|g2|
			r2 = rs[g2]
			if r.right<=r2.x || r2.right<=r.x
			else
				U[g,g2]
			end
		}
	end
	if gs = T2G[r.y]
		gs.each{|g2|
			r2 = rs[g2]
			if r.right<=r2.x || r2.right<=r.x
			else
				U[g,g2]
			end
		}
	end
}

puts Z.values_at(*rs.size.times.map(&F).uniq).sort.tap{p _1.size}*' '

提出情報

ジャッジ結果