Submission #67355089

---

Source Code Expand

H,W,K = gets.split.map(&:to_i)
G = Array.new(H+2){ [nil]*(W+2) }
Q = Array.new(H*W+1){ [] }
Q[0] = K.times.map{
	gets.split.map{_1.to_i-1}
}
Q.each_with_index{|ijs,d|
	ijs.select{|i,j|
		G[i][j] = d unless G[i][j]
	}.each{|i,j|
		if ! G[i-1][j]
			if G[i-1][j-1] || G[i-1][j+1] || G[i-2][j]
				Q[d+1]<<[i-1,j]
			end
		end
		if ! G[i+1][j]
			if G[i+1][j-1] || G[i+1][j+1] || G[i+2][j]
				Q[d+1]<<[i+1,j]
			end
		end
		if ! G[i][j-1]
			if G[i-1][j-1] || G[i+1][j-1] || G[i][j-2]
				Q[d+1]<<[i,j-1]
			end
		end
		if ! G[i][j+1]
			if G[i-1][j+1] || G[i+1][j+1] || G[i][j+2]
				Q[d+1]<<[i,j+1]
			end
		end
	}
}
p G.flatten.compact.sum

Submission Info

Judge Result