Submission #68953965

---

Source Code Expand

Tr,Tc,Ar,Ac = gets.split.map(&:to_i)
N,Tn,An = gets.split.map(&:to_i)
Tm,Am = [[Tn,Tr,Tc],[An,Ar,Ac]].map{|n,r,c,i=0|
	n.times.map{
		d,l = gets.split
		l = l.to_i
		dr,dc = {
			?U=>[-1,0],
			?D=>[1,0],
			?L=>[0,-1],
			?R=>[0,1]
		}[d]
		r0,c0,r,c = r,c,r+dr*l,c+dc*l
		next i,(i+=l),r0,dr,c0,dc
	}
}
Ts = (Tm.map{|i,|i}|Am.map{|i,|i}|[N]).sort
D = lambda{|(t0,_,r0,dr0,c0,dc0),(t1,_,r1,dr1,c1,dc1),t|
	r0 += dr0*(t-t0)
	c0 += dc0*(t-t0)
	r1 += dr1*(t-t1)
	c1 += dc1*(t-t1)
	next (r1-r0).abs+(c1-c0).abs
}
X = lambda{|tm,am,t0,t| # t0 は数えない
	d0 = D[tm,am,t0]
	d1 = D[tm,am,t0+1]
	if d0==0
		d1==0 ? t-t0 : 0
	elsif d1<d0
		dt = d0/(d0-d1)
		t0+dt<=t && D[tm,am,t0+dt]==0 ? 1 : 0
	else
		0
	end
}

x = 0
t0 = Ts.shift # 0
while t = Ts.shift
	# t0+1..t
	Tm.shift if Tm[0][1]==t0
	Am.shift if Am[0][1]==t0
	x += X[Tm[0],Am[0],t0,t]
	t0 = t
end
p x

Submission Info

Judge Result