提出 #19915433

---

ソースコード 拡げる

n,m = gets.chomp.split(" ").map(&:to_i)
g = Array.new(n+1){Array.new}
m.times do
  a,b = gets.chomp.split(" ").map(&:to_i)
  g[a] << b
  g[b] << a
end
k = gets.to_i
c = gets.chomp.split(" ").map(&:to_i)

G = Array.new(k){Array.new(k,0)}
k.times do |i|
  dist = Array.new(n+1,-1)
  queue = [c[i]]
  dist[c[i]] = 0
  while queue.empty?.!
    v = queue[0]
    queue.shift
    g[v].each do |to|
      if dist[to] == -1
        dist[to] = dist[v] + 1
        queue << to
      end
    end
  end
  k.times do |j|
    next if i == j
    G[i][j] = dist[c[j]]
  end
end

if G.any?{|arr| arr.any?{|v|v == -1}}
  puts -1
else
  bit = 1<<k
  dp = Array.new(bit){Array.new(k,10**9)}
  k.times do |i|
    dp[1<<i][i] = 0
  end
  bit.times do |i|
    zumi,mada = k.times.partition{|v| i[v] == 1}
    zumi.each do |j|
      gj = G[j]
      dpij = dp[i][j]
      mada.each do |k|
        x = dpij + gj[k]
        y = i|(1<<k)
        dp[y][k] = x if dp[y][k] > x
      end
    end
  end
  puts dp[-1].min + 1
end

提出情報

コンパイルエラー

./Main.rb:33: warning: ambiguous first argument; put parentheses or a space even after `-' operator

ジャッジ結果