Submission #14183943

---

Source Code Expand

(N,K,D),A = 2.times.map{ gets.split.map(&:to_i) }

B,BL = A.map.with_index.to_a,1<<A.size.bit_length
H = [nil]*(BL-1) + B + [B[-1]]*(BL-B.size)
Less = lambda{|a,b|
	next a[0]<b[0] || a[0]==b[0] && a[1]<b[1]
}
(BL-2).downto(0){|i|
	j = 2*i+1
	H[i] = Less[H[j+1],H[j]] ? H[j+1] : H[j]
}
Min = lambda{|s,e|
	next nil if e<s || N<=s
	s,e = [s,e].map{|_|(_&BL-1)+BL-1}
	m1,m2 = H[s],H[e]
	while 0
		sp,ep = (s-1)/2,(e-1)/2
		sp += s&1^1
		ep -= e&1
		break if ep<sp
		m1 = H[sp] if Less[H[sp],m1]
		m2 = H[ep] if Less[H[ep],m2]
		s,e = sp,ep
	end if s<e
	next Less[m2,m1] ? m2 : m1
}

c,C = -D,[]
K.downto(1){|k|
	m,i = Min[c+D, N-1-D*(k-1)]
	break unless m
	C << m
	c = i
}
puts(C.size==K ? C.join(" ") : -1)

Submission Info

Compile Error

./Main.rb:24: warning: literal in condition

Judge Result