Submission #44396116

Source Code Expand

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
((RX0,RX1),(RY0,RY1)),
((LX0,LX1),(LY0,LY1)),
((UX0,UX1),(UY0,UY1)),
((DX0,DX1),(DY0,DY1)) =
gets.to_i.times.map{
  gets.split.then{|x,y,d| [x.to_i,y.to_i,d] }
}.group_by(&:pop).transform_values{|xys|
  xys.transpose.map(&:minmax)
}.values_at(*'RLUD'.chars)
S = lambda{|t|
  t *= 0.5
  l = [RX0,LX0,UX0,DX0].zip([t,-t,0,0]).select{|x,|x}.map(&:sum).min
  r = [RX1,LX1,UX1,DX1].zip([t,-t,0,0]).select{|x,|x}.map(&:sum).max
  d = [RY0,LY0,UY0,DY0].zip([0,0,t,-t]).select{|y,|y}.map(&:sum).min
  u = [RY1,LY1,UY1,DY1].zip([0,0,t,-t]).select{|y,|y}.map(&:sum).max
  next (r-l)*(u-d)
}
TX = [0]
TX<<LX1-RX1 if RX1 && LX1 && RX1<LX1
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

((RX0,RX1),(RY0,RY1)),
((LX0,LX1),(LY0,LY1)),
((UX0,UX1),(UY0,UY1)),
((DX0,DX1),(DY0,DY1)) =
gets.to_i.times.map{
	gets.split.then{|x,y,d| [x.to_i,y.to_i,d] }
}.group_by(&:pop).transform_values{|xys|
	xys.transpose.map(&:minmax)
}.values_at(*'RLUD'.chars)

S = lambda{|t|
	t *= 0.5
	l = [RX0,LX0,UX0,DX0].zip([t,-t,0,0]).select{|x,|x}.map(&:sum).min
	r = [RX1,LX1,UX1,DX1].zip([t,-t,0,0]).select{|x,|x}.map(&:sum).max
	d = [RY0,LY0,UY0,DY0].zip([0,0,t,-t]).select{|y,|y}.map(&:sum).min
	u = [RY1,LY1,UY1,DY1].zip([0,0,t,-t]).select{|y,|y}.map(&:sum).max
	next (r-l)*(u-d)
}

TX = [0]
TX<<LX1-RX1 if RX1 && LX1 && RX1<LX1
TX<<2*(UX1-RX1) if RX1 && UX1 && RX1<UX1
TX<<2*(DX1-RX1) if RX1 && DX1 && RX1<DX1
TX<<LX0-RX0 if LX0 && RX0 && RX0<LX0
TX<<2*(LX0-UX0) if LX0 && UX0 && UX0<LX0
TX<<2*(LX0-DX0) if LX0 && DX0 && DX0<LX0
TX.sort!.uniq!

TY = [0]
TY<<DX1-UX1 if UX1 && DX1 && UX1<DX1
TY<<2*(RX1-UX1) if UX1 && RX1 && UX1<RX1
TY<<2*(LX1-UX1) if UX1 && LX1 && UX1<LX1
TY<<DX0-UX0 if DX0 && UX0 && UX0<DX0
TY<<2*(DX0-RX0) if DX0 && RX0 && RX0<DX0
TY<<2*(DX0-LX0) if DX0 && LX0 && LX0<DX0
TY.sort!.uniq!

x1 = y1 = 0
while TX[x1]||TY[y1]
	TX.delete_at x1 while TX[x1] && TX[x1]<TY[y1] if TY[y1]
	y1 += 1
	TY.delete_at y1 while TY[y1] && TY[y1]<TX[x1] if TX[x1]
	x1 += 1
end
T = 0,*(TX|TY).sort

p T.each_cons(2).map{|t0,t1|
	S[t0]<S[t0.to_f.next_float.next_float] ? [S[t0],S[t1]].min : S[(t0...t1).bsearch{|t| S[t]<S[t+1] }||t1]
}.min

Submission Info

Judge Result