提出 #71212471

---

ソースコード 拡げる

gets.to_i.times{
	r,c = gets.split.map(&:to_i)
	rx = gets.split.map(&:to_i)
	cx = gets.split.map(&:to_i)
	x2i = [nil]*r
	x2j = [nil]*c
	rx.each_with_index{|x,i|
		x2i[x] = i
	}
	cx.each_with_index{|x,j|
		x2j[x] = j
	}
	mtx = Array.new(r){ [nil]*c }

	ix = jx = nil
	(r*c).downto(1){|x|
		i = x2i[x]
		j = x2j[x]
		ix ||= i
		jx ||= j
		if i&&j
			mtx[i][j] = x
		elsif i && jx
			mtx[i][jx] = x
		elsif j && ix
			mtx[ix][j] = x
		end
	}

	que = ([*1..r*c]-mtx.flatten.compact).sort
	ij = [*0...r].product([*0...c]).sort_by{|i,j| [rx[i],cx[j]].min }
	ij.reverse_each{|i,j|
		a = mtx[i][j]
		x = [rx[i],cx[j]].min
		if ! a && que[0] && que[-1]<=x
			mtx[i][j] = que.pop
		end
	}
	if que.empty?
#		warn mtx.flatten.compact.uniq.size==r*c
#		warn mtx.map(&:max)==rx
#		warn mtx.transpose.map(&:max)==cx
		puts 'Yes',mtx.map{|r| r*' ' }
	else
		puts 'No'
	end
}

提出情報

ジャッジ結果